/* 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 /* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */ #ifdef c_plusplus #ifndef __cplusplus #define __cplusplus #endif #endif #ifdef __cplusplus #include #include /* Use prototypes in function declarations. */ #define YY_USE_PROTOS /* The "const" storage-class-modifier is valid. */ #define YY_USE_CONST #else /* ! __cplusplus */ #if __STDC__ #define YY_USE_PROTOS #define YY_USE_CONST #endif /* __STDC__ */ #endif /* ! __cplusplus */ #ifdef __TURBOC__ #pragma warn -rch #pragma warn -use #include #include #define YY_USE_CONST #define YY_USE_PROTOS #endif #ifdef YY_USE_CONST #define __IDL_const const #else #define __IDL_const #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 __IDL__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 ((__IDL__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 __IDL_restart( __IDL_in ) #define YY_END_OF_BUFFER_CHAR 0 /* Size of default input buffer. */ #define YY_BUF_SIZE 16384 typedef struct __IDL__buffer_state *YY_BUFFER_STATE; extern int __IDL_leng; extern FILE *__IDL_in, *__IDL_out; #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 ) * __IDL_less( 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 __IDL_less() call. */ /* Return all but the first 'n' matched characters back to the input stream. */ #define __IDL_less(n) \ do \ { \ /* Undo effects of setting up __IDL_text. */ \ *__IDL__cp = __IDL__hold_char; \ YY_RESTORE_YY_MORE_OFFSET \ __IDL__c_buf_p = __IDL__cp = __IDL__bp + n - YY_MORE_ADJ; \ YY_DO_BEFORE_ACTION; /* set up __IDL_text again */ \ } \ while ( 0 ) #define unput(c) __IDL_unput( c, __IDL_text_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 __IDL__size_t; struct __IDL__buffer_state { FILE *__IDL__input_file; char *__IDL__ch_buf; /* input buffer */ char *__IDL__buf_pos; /* current position in input buffer */ /* Size of input buffer in bytes, not including room for EOB * characters. */ __IDL__size_t __IDL__buf_size; /* Number of characters read into __IDL__ch_buf, not including EOB * characters. */ int __IDL__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 __IDL__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 __IDL__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 __IDL__at_bol; /* Whether to try to fill the input buffer when we reach the * end of it. */ int __IDL__fill_buffer; int __IDL__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 __IDL_restart()), so that the user can continue scanning by * just pointing __IDL_in at a new input file. */ #define YY_BUFFER_EOF_PENDING 2 }; static YY_BUFFER_STATE __IDL__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 __IDL__current_buffer /* __IDL__hold_char holds the character lost when __IDL_text is formed. */ static char __IDL__hold_char; static int __IDL__n_chars; /* number of characters read into __IDL__ch_buf */ int __IDL_leng; /* Points to current character in buffer. */ static char *__IDL__c_buf_p = (char *) 0; static int __IDL__init = 1; /* whether we need to initialize */ static int __IDL__start = 0; /* start state number */ /* Flag which is used to allow __IDL_wrap()'s to do buffer switches * instead of setting up a fresh __IDL_in. A bit of a hack ... */ static int __IDL__did_buffer_switch_on_eof; void __IDL_restart YY_PROTO(( FILE *input_file )); void __IDL__switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer )); void __IDL__load_buffer_state YY_PROTO(( void )); YY_BUFFER_STATE __IDL__create_buffer YY_PROTO(( FILE *file, int size )); void __IDL__delete_buffer YY_PROTO(( YY_BUFFER_STATE b )); void __IDL__init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file )); void __IDL__flush_buffer YY_PROTO(( YY_BUFFER_STATE b )); #define YY_FLUSH_BUFFER __IDL__flush_buffer( __IDL__current_buffer ) YY_BUFFER_STATE __IDL__scan_buffer YY_PROTO(( char *base, __IDL__size_t size )); YY_BUFFER_STATE __IDL__scan_string YY_PROTO(( __IDL_const char *__IDL__str )); YY_BUFFER_STATE __IDL__scan_bytes YY_PROTO(( __IDL_const char *bytes, int len )); static void *__IDL__flex_alloc YY_PROTO(( __IDL__size_t )); static void *__IDL__flex_realloc YY_PROTO(( void *, __IDL__size_t )); static void __IDL__flex_free YY_PROTO(( void * )); #define __IDL__new_buffer __IDL__create_buffer #define __IDL__set_interactive(is_interactive) \ { \ if ( ! __IDL__current_buffer ) \ __IDL__current_buffer = __IDL__create_buffer( __IDL_in, YY_BUF_SIZE ); \ __IDL__current_buffer->__IDL__is_interactive = is_interactive; \ } #define __IDL__set_bol(at_bol) \ { \ if ( ! __IDL__current_buffer ) \ __IDL__current_buffer = __IDL__create_buffer( __IDL_in, YY_BUF_SIZE ); \ __IDL__current_buffer->__IDL__at_bol = at_bol; \ } #define YY_AT_BOL() (__IDL__current_buffer->__IDL__at_bol) typedef unsigned char YY_CHAR; FILE *__IDL_in = (FILE *) 0, *__IDL_out = (FILE *) 0; typedef int __IDL__state_type; extern char *__IDL_text; #define __IDL_text_ptr __IDL_text static __IDL__state_type __IDL__get_previous_state YY_PROTO(( void )); static __IDL__state_type __IDL__try_NUL_trans YY_PROTO(( __IDL__state_type current_state )); static int __IDL__get_next_buffer YY_PROTO(( void )); static void __IDL__fatal_error YY_PROTO(( __IDL_const char msg[] )); /* Done after the current pattern has been matched and before the * corresponding action - sets up __IDL_text. */ #define YY_DO_BEFORE_ACTION \ __IDL_text_ptr = __IDL__bp; \ __IDL_leng = (int) (__IDL__cp - __IDL__bp); \ __IDL__hold_char = *__IDL__cp; \ *__IDL__cp = '\0'; \ __IDL__c_buf_p = __IDL__cp; #define YY_NUM_RULES 68 #define YY_END_OF_BUFFER 69 static __IDL_const short int __IDL__accept[378] = { 0, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 69, 67, 6, 65, 67, 67, 67, 67, 67, 7, 9, 67, 67, 67, 57, 57, 57, 57, 67, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 6, 5, 67, 57, 67, 67, 60, 67, 6, 65, 67, 6, 5, 3, 3, 3, 3, 3, 3, 6, 0, 64, 0, 63, 0, 12, 8, 12, 66, 12, 7, 11, 0, 0, 9, 53, 55, 54, 57, 59, 57, 57, 57, 58, 58, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 29, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 6, 0, 5, 5, 5, 0, 57, 1, 0, 60, 0, 62, 6, 66, 6, 0, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 12, 8, 0, 66, 12, 0, 12, 10, 57, 57, 57, 58, 16, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 38, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 0, 0, 5, 49, 57, 1, 61, 66, 62, 0, 0, 5, 3, 3, 3, 3, 2, 0, 12, 57, 57, 15, 58, 57, 57, 19, 20, 57, 57, 57, 57, 25, 57, 57, 57, 57, 57, 32, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 50, 57, 57, 0, 5, 57, 0, 5, 3, 3, 13, 57, 58, 57, 57, 21, 57, 57, 57, 57, 27, 28, 30, 57, 57, 57, 36, 57, 57, 57, 57, 42, 57, 57, 57, 57, 47, 57, 51, 57, 0, 5, 57, 0, 5, 3, 3, 14, 58, 57, 57, 57, 57, 24, 57, 57, 33, 34, 37, 39, 57, 57, 43, 44, 45, 57, 57, 57, 0, 5, 57, 0, 5, 3, 3, 58, 57, 18, 22, 23, 57, 57, 57, 57, 46, 57, 52, 0, 4, 57, 0, 4, 3, 3, 58, 57, 57, 57, 40, 41, 48, 4, 4, 4, 35, 4, 4, 4, 4, 3, 3, 3, 58, 17, 26, 31, 4, 4, 4, 4, 4, 3, 3, 58, 0, 0, 0, 56, 0, 0, 0 } ; static __IDL_const int __IDL__ec[256] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 4, 5, 1, 6, 1, 7, 8, 9, 1, 1, 1, 10, 11, 12, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 1, 16, 1, 17, 1, 1, 18, 19, 19, 20, 21, 22, 23, 23, 23, 23, 23, 24, 23, 23, 25, 23, 23, 26, 27, 28, 29, 23, 23, 30, 23, 23, 1, 1, 1, 1, 31, 1, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 23, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 23, 56, 1, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 __IDL_const int __IDL__meta[58] = { 0, 1, 2, 3, 1, 1, 1, 1, 1, 4, 1, 1, 1, 5, 5, 1, 1, 1, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1 } ; static __IDL_const short int __IDL__base[406] = { 0, 0, 56, 48, 58, 102, 159, 63, 65, 76, 78, 962, 963, 959, 963, 82, 84, 82, 84, 948, 206, 109, 944, 942, 940, 925, 58, 40, 68, 924, 90, 93, 96, 101, 95, 111, 112, 105, 146, 69, 148, 116, 147, 100, 149, 150, 153, 152, 183, 190, 176, 898, 0, 0, 944, 187, 943, 197, 209, 221, 0, 949, 938, 208, 186, 892, 946, 230, 963, 191, 963, 224, 233, 237, 242, 0, 261, 272, 963, 251, 0, 289, 963, 963, 963, 916, 0, 181, 194, 214, 0, 911, 197, 209, 235, 200, 239, 245, 253, 31, 248, 257, 263, 256, 273, 267, 281, 264, 282, 284, 288, 290, 274, 295, 291, 191, 297, 298, 300, 303, 296, 302, 343, 337, 0, 339, 897, 933, 315, 0, 934, 0, 933, 963, 345, 347, 353, 351, 348, 363, 0, 358, 0, 939, 0, 366, 357, 0, 361, 892, 0, 366, 378, 360, 0, 391, 362, 368, 0, 357, 359, 379, 903, 907, 377, 386, 384, 385, 387, 362, 388, 391, 393, 399, 400, 392, 408, 407, 409, 338, 410, 411, 906, 416, 417, 418, 419, 422, 420, 423, 426, 432, 443, 424, 427, 459, 888, 903, 963, 445, 0, 963, 474, 0, 478, 459, 479, 0, 464, 886, 901, 0, 471, 476, 460, 461, 901, 897, 462, 463, 899, 898, 465, 467, 455, 466, 897, 470, 469, 478, 481, 482, 896, 483, 486, 487, 488, 490, 491, 496, 492, 502, 509, 510, 504, 503, 514, 895, 517, 518, 893, 886, 519, 542, 550, 891, 884, 890, 523, 878, 524, 529, 888, 525, 533, 532, 531, 887, 886, 885, 535, 540, 546, 884, 538, 547, 539, 553, 883, 549, 554, 555, 559, 882, 558, 881, 561, 873, 867, 560, 589, 598, 871, 865, 876, 857, 568, 572, 575, 578, 874, 577, 579, 873, 872, 871, 870, 581, 584, 869, 868, 867, 583, 590, 591, 854, 864, 593, 604, 627, 852, 862, 847, 600, 861, 860, 857, 601, 603, 602, 604, 855, 607, 848, 831, 853, 612, 635, 646, 807, 829, 787, 620, 614, 629, 776, 762, 754, 775, 0, 748, 710, 661, 663, 666, 0, 687, 0, 685, 651, 622, 621, 498, 0, 394, 668, 671, 0, 0, 123, 674, 676, 652, 677, 963, 679, 681, 963, 690, 698, 706, 714, 722, 726, 730, 738, 746, 750, 758, 766, 774, 782, 790, 794, 796, 804, 812, 820, 828, 836, 844, 852, 860, 868, 876, 883 } ; static __IDL_const short int __IDL__def[406] = { 0, 377, 1, 1, 1, 378, 378, 379, 379, 380, 380, 377, 377, 377, 377, 381, 382, 377, 377, 377, 377, 377, 377, 377, 377, 383, 383, 383, 383, 384, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 377, 385, 377, 383, 377, 386, 387, 388, 388, 388, 388, 388, 389, 390, 390, 390, 390, 391, 390, 377, 381, 377, 382, 377, 377, 377, 377, 377, 392, 377, 377, 377, 377, 393, 377, 377, 377, 377, 383, 394, 383, 383, 383, 384, 384, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 377, 377, 385, 385, 385, 377, 383, 395, 386, 387, 388, 377, 388, 396, 388, 388, 389, 389, 385, 389, 390, 390, 397, 390, 390, 391, 391, 391, 398, 377, 377, 377, 392, 377, 377, 377, 393, 383, 383, 383, 384, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 377, 377, 385, 377, 383, 395, 377, 396, 392, 388, 388, 389, 397, 390, 390, 391, 398, 377, 377, 383, 383, 383, 384, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 377, 385, 383, 388, 389, 390, 391, 383, 383, 384, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 377, 385, 383, 388, 389, 390, 391, 383, 384, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 377, 385, 383, 388, 389, 390, 391, 384, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 383, 377, 399, 383, 388, 400, 390, 401, 384, 383, 383, 383, 383, 383, 383, 402, 399, 399, 383, 403, 400, 400, 399, 404, 401, 401, 384, 383, 383, 383, 402, 402, 403, 403, 402, 404, 404, 384, 377, 405, 405, 377, 405, 377, 0, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377 } ; static __IDL_const short int __IDL__nxt[1021] = { 0, 12, 13, 14, 15, 12, 12, 16, 12, 12, 17, 18, 19, 20, 21, 22, 23, 24, 25, 25, 25, 25, 26, 25, 25, 27, 25, 25, 28, 25, 25, 29, 30, 31, 32, 33, 34, 35, 25, 25, 36, 25, 37, 38, 39, 40, 25, 25, 41, 42, 43, 44, 45, 46, 25, 25, 12, 12, 47, 49, 47, 48, 86, 48, 51, 55, 56, 58, 56, 49, 59, 86, 12, 88, 12, 57, 87, 57, 61, 14, 63, 14, 170, 64, 65, 68, 68, 70, 62, 86, 62, 70, 50, 71, 89, 72, 73, 74, 74, 86, 86, 107, 50, 12, 13, 14, 12, 12, 12, 12, 52, 12, 12, 12, 19, 12, 12, 12, 12, 12, 76, 86, 81, 81, 86, 369, 86, 86, 95, 78, 79, 86, 86, 12, 92, 96, 86, 98, 94, 100, 93, 97, 86, 86, 78, 79, 99, 86, 111, 101, 105, 102, 112, 103, 122, 117, 104, 123, 12, 12, 12, 47, 14, 12, 48, 12, 12, 52, 12, 12, 12, 19, 12, 12, 12, 12, 12, 86, 86, 86, 86, 86, 108, 113, 86, 125, 114, 120, 148, 134, 12, 106, 109, 118, 70, 119, 133, 115, 70, 110, 116, 127, 121, 74, 74, 159, 133, 86, 107, 135, 145, 136, 86, 146, 137, 12, 12, 76, 133, 77, 77, 128, 86, 139, 132, 86, 78, 79, 86, 126, 140, 86, 149, 68, 68, 160, 80, 74, 74, 187, 86, 78, 79, 161, 76, 86, 151, 151, 76, 166, 152, 152, 163, 78, 79, 74, 74, 78, 79, 164, 80, 156, 78, 153, 157, 157, 86, 141, 78, 79, 86, 167, 78, 79, 155, 155, 86, 78, 153, 86, 165, 78, 79, 76, 86, 77, 77, 86, 86, 168, 169, 172, 78, 79, 86, 86, 78, 79, 86, 171, 76, 174, 81, 81, 86, 86, 184, 78, 79, 78, 79, 177, 86, 86, 179, 86, 178, 173, 175, 86, 181, 86, 86, 176, 78, 79, 86, 86, 86, 86, 183, 86, 180, 86, 86, 193, 186, 188, 182, 195, 190, 125, 185, 192, 189, 122, 86, 134, 123, 191, 132, 132, 194, 204, 133, 136, 203, 140, 137, 208, 133, 132, 133, 148, 199, 139, 132, 140, 145, 86, 212, 146, 140, 213, 213, 157, 157, 76, 234, 151, 151, 157, 157, 196, 214, 126, 78, 79, 86, 76, 86, 152, 152, 86, 224, 215, 364, 205, 78, 79, 216, 78, 79, 209, 155, 155, 206, 149, 86, 141, 86, 78, 153, 78, 79, 86, 86, 86, 86, 86, 220, 225, 86, 86, 86, 218, 78, 153, 219, 227, 86, 86, 229, 221, 226, 228, 222, 223, 86, 86, 86, 86, 86, 230, 231, 232, 235, 86, 86, 86, 86, 86, 238, 86, 86, 86, 248, 86, 86, 244, 233, 195, 241, 86, 236, 237, 208, 240, 133, 239, 243, 245, 246, 242, 86, 249, 86, 132, 247, 252, 204, 257, 132, 203, 213, 213, 86, 133, 140, 213, 213, 86, 86, 86, 86, 258, 86, 86, 86, 261, 86, 86, 260, 263, 267, 196, 264, 253, 265, 86, 209, 254, 86, 86, 86, 262, 266, 86, 86, 86, 274, 86, 86, 86, 205, 271, 275, 86, 268, 86, 270, 269, 277, 86, 86, 86, 276, 273, 272, 282, 86, 86, 278, 280, 281, 86, 279, 283, 86, 86, 86, 133, 284, 132, 86, 86, 86, 296, 286, 140, 86, 297, 86, 86, 86, 285, 86, 289, 300, 86, 86, 86, 302, 294, 290, 299, 303, 86, 86, 298, 86, 301, 304, 307, 86, 86, 86, 309, 291, 86, 86, 86, 86, 305, 311, 312, 306, 308, 133, 86, 317, 132, 313, 86, 310, 314, 86, 140, 86, 86, 86, 328, 86, 133, 86, 86, 324, 327, 330, 323, 331, 86, 86, 329, 86, 325, 332, 318, 326, 333, 132, 86, 86, 86, 86, 86, 140, 344, 86, 336, 346, 319, 347, 86, 133, 86, 343, 337, 354, 132, 342, 86, 86, 86, 373, 355, 360, 345, 361, 338, 86, 374, 351, 366, 132, 362, 132, 352, 354, 132, 367, 132, 355, 366, 132, 355, 371, 367, 371, 373, 367, 376, 372, 376, 372, 370, 374, 358, 374, 369, 374, 53, 53, 53, 53, 53, 53, 53, 53, 54, 54, 54, 54, 54, 54, 54, 54, 60, 60, 60, 60, 60, 60, 60, 60, 67, 67, 67, 67, 67, 67, 67, 67, 69, 69, 69, 69, 69, 69, 69, 69, 85, 85, 85, 85, 90, 90, 90, 90, 124, 124, 86, 124, 124, 124, 124, 124, 130, 130, 130, 350, 130, 130, 130, 130, 131, 131, 131, 131, 132, 132, 132, 132, 132, 132, 132, 132, 138, 138, 138, 138, 138, 138, 138, 138, 142, 142, 364, 142, 142, 142, 142, 142, 147, 147, 86, 147, 147, 147, 147, 147, 154, 154, 86, 154, 154, 154, 154, 154, 158, 158, 86, 86, 86, 86, 200, 200, 86, 200, 200, 200, 200, 200, 202, 202, 202, 202, 202, 202, 202, 202, 207, 207, 359, 207, 207, 207, 207, 207, 211, 211, 358, 211, 211, 211, 211, 211, 349, 349, 356, 349, 349, 349, 349, 349, 353, 353, 353, 353, 353, 353, 353, 353, 357, 357, 350, 357, 357, 357, 357, 357, 363, 363, 348, 363, 363, 363, 363, 363, 365, 365, 365, 365, 365, 365, 365, 365, 368, 368, 86, 368, 368, 368, 368, 368, 375, 86, 375, 86, 375, 375, 86, 86, 341, 340, 339, 335, 334, 86, 86, 86, 86, 86, 86, 86, 86, 322, 86, 321, 320, 316, 315, 86, 86, 86, 86, 86, 86, 86, 86, 295, 86, 293, 292, 288, 287, 86, 86, 86, 86, 86, 259, 86, 256, 255, 251, 250, 86, 86, 217, 210, 143, 133, 201, 198, 197, 162, 86, 66, 150, 144, 143, 133, 133, 129, 91, 86, 84, 83, 82, 75, 66, 377, 11, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377 } ; static __IDL_const short int __IDL__chk[1021] = { 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, 2, 3, 4, 2, 99, 4, 4, 7, 7, 8, 8, 4, 8, 27, 7, 27, 8, 7, 26, 8, 9, 9, 10, 10, 99, 10, 10, 15, 15, 16, 9, 26, 10, 16, 3, 17, 28, 17, 17, 18, 18, 28, 39, 39, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 21, 30, 21, 21, 31, 369, 34, 32, 32, 21, 21, 43, 33, 5, 30, 32, 37, 33, 31, 34, 30, 32, 35, 36, 21, 21, 33, 41, 41, 34, 37, 35, 41, 35, 47, 43, 36, 47, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 38, 42, 40, 44, 45, 40, 42, 46, 48, 42, 46, 64, 55, 6, 38, 40, 44, 69, 45, 55, 42, 69, 40, 42, 49, 46, 49, 49, 87, 57, 50, 50, 57, 63, 58, 87, 63, 58, 6, 6, 20, 58, 20, 20, 50, 115, 59, 59, 88, 20, 20, 92, 48, 59, 95, 64, 67, 67, 88, 20, 71, 71, 115, 93, 20, 20, 89, 72, 89, 72, 72, 73, 95, 73, 73, 92, 72, 72, 74, 74, 73, 73, 93, 20, 79, 74, 74, 79, 79, 94, 59, 72, 72, 96, 96, 73, 73, 76, 76, 97, 74, 74, 100, 94, 76, 76, 77, 98, 77, 77, 103, 101, 97, 98, 101, 77, 77, 102, 107, 76, 76, 105, 100, 81, 103, 81, 81, 104, 112, 112, 77, 77, 81, 81, 105, 106, 108, 107, 109, 106, 102, 104, 110, 109, 111, 114, 104, 81, 81, 113, 120, 116, 117, 111, 118, 108, 121, 119, 120, 114, 116, 110, 123, 118, 125, 113, 119, 117, 122, 128, 134, 122, 118, 135, 138, 121, 137, 134, 136, 135, 138, 136, 146, 137, 141, 136, 148, 128, 139, 139, 141, 145, 179, 153, 145, 139, 153, 153, 156, 156, 151, 179, 151, 151, 157, 157, 123, 159, 125, 151, 151, 159, 152, 160, 152, 152, 169, 169, 160, 364, 137, 152, 152, 161, 151, 151, 146, 155, 155, 141, 148, 164, 139, 161, 155, 155, 152, 152, 166, 167, 165, 168, 170, 166, 170, 171, 175, 172, 164, 155, 155, 165, 172, 173, 174, 174, 167, 171, 173, 168, 168, 177, 176, 178, 180, 181, 175, 176, 177, 180, 183, 184, 185, 186, 188, 184, 187, 189, 193, 193, 190, 194, 189, 178, 195, 187, 191, 181, 183, 208, 186, 205, 185, 188, 190, 191, 187, 192, 194, 199, 202, 192, 199, 204, 214, 206, 202, 212, 212, 224, 204, 206, 213, 213, 214, 215, 218, 219, 215, 222, 225, 223, 219, 228, 227, 218, 223, 228, 195, 224, 205, 225, 229, 208, 206, 230, 231, 233, 222, 227, 234, 235, 236, 236, 237, 238, 240, 204, 233, 237, 239, 229, 362, 231, 230, 239, 241, 245, 244, 238, 235, 234, 244, 242, 243, 240, 242, 243, 246, 241, 245, 248, 249, 252, 253, 246, 254, 258, 260, 263, 260, 249, 254, 261, 261, 266, 265, 264, 248, 270, 252, 265, 274, 276, 271, 270, 258, 253, 264, 271, 272, 275, 263, 279, 266, 272, 276, 277, 280, 281, 279, 254, 284, 282, 289, 286, 274, 281, 282, 275, 277, 290, 296, 289, 291, 284, 297, 280, 286, 298, 291, 301, 299, 302, 302, 307, 318, 312, 308, 297, 301, 308, 296, 312, 313, 314, 307, 317, 298, 313, 290, 299, 314, 319, 323, 327, 329, 328, 330, 319, 328, 332, 317, 330, 291, 332, 336, 337, 343, 327, 318, 338, 338, 323, 342, 361, 360, 372, 338, 342, 329, 343, 319, 344, 372, 336, 352, 352, 344, 353, 337, 354, 354, 352, 365, 353, 366, 366, 354, 370, 365, 371, 373, 366, 375, 370, 376, 371, 359, 373, 358, 375, 356, 376, 378, 378, 378, 378, 378, 378, 378, 378, 379, 379, 379, 379, 379, 379, 379, 379, 380, 380, 380, 380, 380, 380, 380, 380, 381, 381, 381, 381, 381, 381, 381, 381, 382, 382, 382, 382, 382, 382, 382, 382, 383, 383, 383, 383, 384, 384, 384, 384, 385, 385, 351, 385, 385, 385, 385, 385, 386, 386, 386, 350, 386, 386, 386, 386, 387, 387, 387, 387, 388, 388, 388, 388, 388, 388, 388, 388, 389, 389, 389, 389, 389, 389, 389, 389, 390, 390, 348, 390, 390, 390, 390, 390, 391, 391, 347, 391, 391, 391, 391, 391, 392, 392, 346, 392, 392, 392, 392, 392, 393, 393, 394, 394, 394, 394, 395, 395, 345, 395, 395, 395, 395, 395, 396, 396, 396, 396, 396, 396, 396, 396, 397, 397, 341, 397, 397, 397, 397, 397, 398, 398, 340, 398, 398, 398, 398, 398, 399, 399, 339, 399, 399, 399, 399, 399, 400, 400, 400, 400, 400, 400, 400, 400, 401, 401, 335, 401, 401, 401, 401, 401, 402, 402, 334, 402, 402, 402, 402, 402, 403, 403, 403, 403, 403, 403, 403, 403, 404, 404, 333, 404, 404, 404, 404, 404, 405, 331, 405, 326, 405, 405, 325, 324, 322, 321, 320, 316, 315, 311, 310, 309, 306, 305, 304, 303, 300, 295, 294, 293, 292, 288, 287, 285, 283, 278, 273, 269, 268, 267, 262, 259, 257, 256, 255, 251, 250, 247, 232, 226, 221, 220, 217, 216, 210, 209, 197, 196, 182, 163, 162, 149, 143, 132, 130, 127, 126, 91, 85, 66, 65, 62, 61, 56, 54, 51, 29, 25, 24, 23, 22, 19, 13, 11, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377, 377 } ; static __IDL__state_type __IDL__last_accepting_state; static char *__IDL__last_accepting_cpos; /* The intent behind this definition is that it'll catch * any uses of REJECT which flex missed. */ #define REJECT reject_used_but_not_detected #define __IDL_more() __IDL_more_used_but_not_detected #define YY_MORE_ADJ 0 #define YY_RESTORE_YY_MORE_OFFSET char *__IDL_text; #line 1 "lexer.l" #define INITIAL 0 /*************************************************************************** lexer.l (IDL flex scanner) Copyright (C) 1998, 1999 Andrew T. Veliath This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library 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 Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. $Id: lexer.l,v 1.60 1999/02/24 03:21:22 andrewtv Exp $ ***************************************************************************/ #line 25 "lexer.l" #include #include #include #include #include #include "rename.h" #include "util.h" #include "parser.h" #define YY_INPUT(buf,result,the_max_size) do { \ if (__IDL_inputcb == NULL) { \ if ((result = fread (buf, 1, the_max_size, __IDL_in)) == YY_NULL && \ ferror (__IDL_in)) \ YY_FATAL_ERROR ("input in flex scanner failed"); \ } else { \ union IDL_input_data data; \ \ data.fill.buffer = buf; \ data.fill.max_size = the_max_size; \ result = (*__IDL_inputcb) (IDL_INPUT_REASON_FILL, &data, \ __IDL_inputcb_user_data); \ if (result < 0) \ YY_FATAL_ERROR ("input callback returned failure"); \ } \ } while (0) #define tokreturn(token) do { \ __IDL_prev_token_line = __IDL_cur_token_line; \ __IDL_cur_token_line = __IDL_cur_line; \ return token; \ } while (0) extern void __IDL_do_pragma (const char *s); #ifdef YYDEBUG extern int __IDL_debug; #endif int __IDL_prev_token_line; int __IDL_cur_token_line; static int warn_underscores; static char * codefrag_desc; static GSList * codefrag_list; static GSList * codefrag_list_tail; #define XPIDL 1 #define XPIDLPROP 2 #define XPIDLNATIVE 3 #define XPIDLCODEFRAGX 4 /* Macros after this point can all be overridden by user definitions in * section 1. */ #ifndef YY_SKIP_YYWRAP #ifdef __cplusplus extern "C" int __IDL_wrap YY_PROTO(( void )); #else extern int __IDL_wrap YY_PROTO(( void )); #endif #endif #ifndef YY_NO_UNPUT static void __IDL_unput YY_PROTO(( int c, char *buf_ptr )); #endif #ifndef __IDL_text_ptr static void __IDL__flex_strncpy YY_PROTO(( char *, __IDL_const char *, int )); #endif #ifdef YY_NEED_STRLEN static int __IDL__flex_strlen YY_PROTO(( __IDL_const char * )); #endif #ifndef YY_NO_INPUT #ifdef __cplusplus static int __IDL_input YY_PROTO(( void )); #else static int input YY_PROTO(( void )); #endif #endif #if YY_STACK_USED static int __IDL__start_stack_ptr = 0; static int __IDL__start_stack_depth = 0; static int *__IDL__start_stack = 0; #ifndef YY_NO_PUSH_STATE static void __IDL__push_state YY_PROTO(( int new_state )); #endif #ifndef YY_NO_POP_STATE static void __IDL__pop_state YY_PROTO(( void )); #endif #ifndef YY_NO_TOP_STATE static int __IDL__top_state YY_PROTO(( void )); #endif #else #define YY_NO_PUSH_STATE 1 #define YY_NO_POP_STATE 1 #define YY_NO_TOP_STATE 1 #endif #ifdef YY_MALLOC_DECL YY_MALLOC_DECL #else #if __STDC__ #ifndef __cplusplus #include #endif #else /* Just try to get by without declaring the routines. This will fail * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int) * or sizeof(void*) != sizeof(int). */ #endif #endif /* Amount of stuff to slurp up with each read. */ #ifndef YY_READ_BUF_SIZE #define YY_READ_BUF_SIZE 8192 #endif /* Copy whatever the last rule matched to the standard output. */ #ifndef ECHO /* This used to be an fputs(), but since the string might contain NUL's, * we now use fwrite(). */ #define ECHO (void) fwrite( __IDL_text, __IDL_leng, 1, __IDL_out ) #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 ( __IDL__current_buffer->__IDL__is_interactive ) \ { \ int c = '*', n; \ for ( n = 0; n < max_size && \ (c = getc( __IDL_in )) != EOF && c != '\n'; ++n ) \ buf[n] = (char) c; \ if ( c == '\n' ) \ buf[n++] = (char) c; \ if ( c == EOF && ferror( __IDL_in ) ) \ YY_FATAL_ERROR( "input in flex scanner failed" ); \ result = n; \ } \ else if ( ((result = fread( buf, 1, max_size, __IDL_in )) == 0) \ && ferror( __IDL_in ) ) \ YY_FATAL_ERROR( "input in flex scanner failed" ); #endif /* No semi-colon after return; correct usage is to write "__IDL_terminate();" - * we don't want an extra ';' after the "return" because that will cause * some compilers to complain about unreachable statements. */ #ifndef __IDL_terminate #define __IDL_terminate() 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) __IDL__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 __IDL_lex YY_PROTO(( void )) #endif /* Code executed at the beginning of each rule, after __IDL_text and __IDL_leng * 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 ( __IDL_leng > 0 ) \ __IDL__current_buffer->__IDL__at_bol = \ (__IDL_text[__IDL_leng - 1] == '\n'); \ YY_USER_ACTION YY_DECL { register __IDL__state_type __IDL__current_state; register char *__IDL__cp, *__IDL__bp; register int __IDL__act; #line 92 "lexer.l" /* Global syntax */ if (__IDL_flags & IDLF_XPIDL) BEGIN (XPIDL); /* Exclusive parser driven conditions */ if (__IDL_flagsi & IDLFP_XPIDL_PROPERTY) BEGIN (XPIDLPROP); else if (__IDL_flagsi & IDLFP_XPIDL_NATIVE) BEGIN (XPIDLNATIVE); if ( __IDL__init ) { __IDL__init = 0; #ifdef YY_USER_INIT YY_USER_INIT; #endif if ( ! __IDL__start ) __IDL__start = 1; /* first start state */ if ( ! __IDL_in ) __IDL_in = stdin; if ( ! __IDL_out ) __IDL_out = stdout; if ( ! __IDL__current_buffer ) __IDL__current_buffer = __IDL__create_buffer( __IDL_in, YY_BUF_SIZE ); __IDL__load_buffer_state(); } while ( 1 ) /* loops until end-of-file is reached */ { __IDL__cp = __IDL__c_buf_p; /* Support of __IDL_text. */ *__IDL__cp = __IDL__hold_char; /* __IDL__bp points to the position in __IDL__ch_buf of the start of * the current run. */ __IDL__bp = __IDL__cp; __IDL__current_state = __IDL__start; __IDL__current_state += YY_AT_BOL(); __IDL__match: do { register YY_CHAR __IDL__c = __IDL__ec[YY_SC_TO_UI(*__IDL__cp)]; if ( __IDL__accept[__IDL__current_state] ) { __IDL__last_accepting_state = __IDL__current_state; __IDL__last_accepting_cpos = __IDL__cp; } while ( __IDL__chk[__IDL__base[__IDL__current_state] + __IDL__c] != __IDL__current_state ) { __IDL__current_state = (int) __IDL__def[__IDL__current_state]; if ( __IDL__current_state >= 378 ) __IDL__c = __IDL__meta[(unsigned int) __IDL__c]; } __IDL__current_state = __IDL__nxt[__IDL__base[__IDL__current_state] + (unsigned int) __IDL__c]; ++__IDL__cp; } while ( __IDL__base[__IDL__current_state] != 963 ); __IDL__find_action: __IDL__act = __IDL__accept[__IDL__current_state]; if ( __IDL__act == 0 ) { /* have to back up */ __IDL__cp = __IDL__last_accepting_cpos; __IDL__current_state = __IDL__last_accepting_state; __IDL__act = __IDL__accept[__IDL__current_state]; } YY_DO_BEFORE_ACTION; do_action: /* This label is used only to access EOF actions. */ switch ( __IDL__act ) { /* beginning of action switch */ case 0: /* must back up */ /* undo the effects of YY_DO_BEFORE_ACTION */ *__IDL__cp = __IDL__hold_char; __IDL__cp = __IDL__last_accepting_cpos; __IDL__current_state = __IDL__last_accepting_state; goto __IDL__find_action; case 1: YY_RULE_SETUP #line 103 "lexer.l" { char *s = __IDL_text + 2; while (isspace (*s)) ++s; codefrag_desc = g_strdup (s); codefrag_list = codefrag_list_tail = NULL; BEGIN (XPIDLCODEFRAGX); } YY_BREAK case 2: YY_RULE_SETUP #line 111 "lexer.l" { __IDL_lval.tree = IDL_codefrag_new (codefrag_desc, codefrag_list); tokreturn (TOK_CODEFRAG); } YY_BREAK case 3: YY_RULE_SETUP #line 115 "lexer.l" { char *s; GSList *slist; s = g_strdup (__IDL_text); slist = g_slist_alloc (); slist->data = s; if (codefrag_list == NULL) { codefrag_list = slist; codefrag_list_tail = slist; } else { codefrag_list_tail->next = slist; codefrag_list_tail = slist; } } YY_BREAK case 4: YY_RULE_SETUP #line 131 "lexer.l" { int n; char *p = __IDL_text; char *s; while (isspace (*p) || *p == '#') ++p; s = p; sscanf (p, "%*6s%n", &n); s += n; while (isspace (*s)) ++s; __IDL_do_pragma (s); } YY_BREAK case 5: YY_RULE_SETUP #line 143 "lexer.l" { char *filename = g_malloc (strlen (__IDL_text) + 1); char *filename2; int line; sscanf (__IDL_text, "# %d %s", &line, filename); if (*filename == '"') { filename2 = g_strdup (filename + 1); filename2[strlen (filename) - 2] = 0; g_free (filename); } else filename2 = filename; IDL_file_set (filename2, line); g_free (filename2); } YY_BREAK case 6: YY_RULE_SETUP #line 161 "lexer.l" YY_BREAK case 7: YY_RULE_SETUP #line 162 "lexer.l" { sscanf (__IDL_text, "%" IDL_LL "o", &__IDL_lval.integer); tokreturn (TOK_INTEGER); } YY_BREAK case 8: YY_RULE_SETUP #line 166 "lexer.l" { sscanf (__IDL_text, "%" IDL_LL "d", &__IDL_lval.integer); tokreturn (TOK_INTEGER); } YY_BREAK case 9: YY_RULE_SETUP #line 170 "lexer.l" { sscanf (__IDL_text, "%" IDL_LL "u", &__IDL_lval.integer); tokreturn (TOK_INTEGER); } YY_BREAK case 10: YY_RULE_SETUP #line 174 "lexer.l" { sscanf (__IDL_text + 2, "%" IDL_LL "x", &__IDL_lval.integer); tokreturn (TOK_INTEGER); } YY_BREAK case 11: YY_RULE_SETUP #line 178 "lexer.l" { __IDL_lval.str = g_strdup (__IDL_text); tokreturn (TOK_FIXEDP); } YY_BREAK case 12: YY_RULE_SETUP #line 182 "lexer.l" { __IDL_lval.floatp = atof (__IDL_text); tokreturn (TOK_FLOATP); } YY_BREAK case 13: YY_RULE_SETUP #line 186 "lexer.l" tokreturn (TOK_FALSE); YY_BREAK case 14: YY_RULE_SETUP #line 187 "lexer.l" tokreturn (TOK_OBJECT); YY_BREAK case 15: YY_RULE_SETUP #line 188 "lexer.l" tokreturn (TOK_TRUE); YY_BREAK case 16: YY_RULE_SETUP #line 189 "lexer.l" tokreturn (TOK_ANY); YY_BREAK case 17: YY_RULE_SETUP #line 190 "lexer.l" tokreturn (TOK_ATTRIBUTE); YY_BREAK case 18: YY_RULE_SETUP #line 191 "lexer.l" tokreturn (TOK_BOOLEAN); YY_BREAK case 19: YY_RULE_SETUP #line 192 "lexer.l" tokreturn (TOK_CASE); YY_BREAK case 20: YY_RULE_SETUP #line 193 "lexer.l" tokreturn (TOK_CHAR); YY_BREAK case 21: YY_RULE_SETUP #line 194 "lexer.l" tokreturn (TOK_CONST); YY_BREAK case 22: YY_RULE_SETUP #line 195 "lexer.l" tokreturn (TOK_CONTEXT); YY_BREAK case 23: YY_RULE_SETUP #line 196 "lexer.l" tokreturn (TOK_DEFAULT); YY_BREAK case 24: YY_RULE_SETUP #line 197 "lexer.l" tokreturn (TOK_DOUBLE); YY_BREAK case 25: YY_RULE_SETUP #line 198 "lexer.l" tokreturn (TOK_ENUM); YY_BREAK case 26: YY_RULE_SETUP #line 199 "lexer.l" tokreturn (TOK_EXCEPTION); YY_BREAK case 27: YY_RULE_SETUP #line 200 "lexer.l" tokreturn (TOK_FIXED); YY_BREAK case 28: YY_RULE_SETUP #line 201 "lexer.l" tokreturn (TOK_FLOAT); YY_BREAK case 29: YY_RULE_SETUP #line 202 "lexer.l" tokreturn (TOK_IN); YY_BREAK case 30: YY_RULE_SETUP #line 203 "lexer.l" tokreturn (TOK_INOUT); YY_BREAK case 31: YY_RULE_SETUP #line 204 "lexer.l" tokreturn (TOK_INTERFACE); YY_BREAK case 32: YY_RULE_SETUP #line 205 "lexer.l" tokreturn (TOK_LONG); YY_BREAK case 33: YY_RULE_SETUP #line 206 "lexer.l" tokreturn (TOK_MODULE); YY_BREAK case 34: YY_RULE_SETUP #line 207 "lexer.l" tokreturn (TOK_NATIVE); YY_BREAK case 35: YY_RULE_SETUP #line 208 "lexer.l" tokreturn (TOK_NOSCRIPT); YY_BREAK case 36: YY_RULE_SETUP #line 209 "lexer.l" tokreturn (TOK_OCTET); YY_BREAK case 37: YY_RULE_SETUP #line 210 "lexer.l" tokreturn (TOK_ONEWAY); YY_BREAK case 38: YY_RULE_SETUP #line 211 "lexer.l" tokreturn (TOK_OUT); YY_BREAK case 39: YY_RULE_SETUP #line 212 "lexer.l" tokreturn (TOK_RAISES); YY_BREAK case 40: YY_RULE_SETUP #line 213 "lexer.l" tokreturn (TOK_READONLY); YY_BREAK case 41: YY_RULE_SETUP #line 214 "lexer.l" tokreturn (TOK_SEQUENCE); YY_BREAK case 42: YY_RULE_SETUP #line 215 "lexer.l" tokreturn (TOK_SHORT); YY_BREAK case 43: YY_RULE_SETUP #line 216 "lexer.l" tokreturn (TOK_STRING); YY_BREAK case 44: YY_RULE_SETUP #line 217 "lexer.l" tokreturn (TOK_STRUCT); YY_BREAK case 45: YY_RULE_SETUP #line 218 "lexer.l" tokreturn (TOK_SWITCH); YY_BREAK case 46: YY_RULE_SETUP #line 219 "lexer.l" tokreturn (TOK_TYPEDEF); YY_BREAK case 47: YY_RULE_SETUP #line 220 "lexer.l" tokreturn (TOK_UNION); YY_BREAK case 48: YY_RULE_SETUP #line 221 "lexer.l" tokreturn (TOK_UNSIGNED); YY_BREAK case 49: YY_RULE_SETUP #line 222 "lexer.l" tokreturn (TOK_VARARGS); YY_BREAK case 50: YY_RULE_SETUP #line 223 "lexer.l" tokreturn (TOK_VOID); YY_BREAK case 51: YY_RULE_SETUP #line 224 "lexer.l" tokreturn (TOK_WCHAR); YY_BREAK case 52: YY_RULE_SETUP #line 225 "lexer.l" tokreturn (TOK_WSTRING); YY_BREAK case 53: YY_RULE_SETUP #line 226 "lexer.l" tokreturn (TOK_OP_SCOPE); YY_BREAK case 54: YY_RULE_SETUP #line 227 "lexer.l" tokreturn (TOK_OP_SHR); YY_BREAK case 55: YY_RULE_SETUP #line 228 "lexer.l" tokreturn (TOK_OP_SHL); YY_BREAK case 56: YY_RULE_SETUP #line 229 "lexer.l" { char *s = g_strdup (__IDL_text); sscanf (__IDL_text, "__declspec %*[(] %[A-Za-z_] %*[)]", s); __IDL_lval.str = s; tokreturn (TOK_DECLSPEC); } YY_BREAK case 57: YY_RULE_SETUP #line 235 "lexer.l" { if (__IDL_flags & IDLF_TYPECODES && strcmp (__IDL_text, "TypeCode") == 0) tokreturn (TOK_TYPECODE); __IDL_lval.str = g_strdup (__IDL_text); tokreturn (TOK_IDENT); } YY_BREAK case 58: YY_RULE_SETUP #line 241 "lexer.l" { __IDL_errorv ("`%s' is not a valid identifier in IDL", __IDL_text); __IDL_error ("(Identifiers cannot start with an underscore)"); __IDL_lval.str = g_strdup (__IDL_text); tokreturn (TOK_IDENT); } YY_BREAK case 59: YY_RULE_SETUP #line 247 "lexer.l" { if (!warn_underscores) { __IDL_warningv (IDL_WARNING2, "`%s' underscores within identifiers are discouraged for use " "with C-language IDL mappings", __IDL_text); warn_underscores = 1; } __IDL_lval.str = g_strdup (__IDL_text); tokreturn (TOK_IDENT); } YY_BREAK case 60: YY_RULE_SETUP #line 257 "lexer.l" { __IDL_lval.str = g_strdup (__IDL_text); tokreturn (TOK_PROP_KEY); } YY_BREAK case 61: YY_RULE_SETUP #line 261 "lexer.l" { __IDL_lval.str = g_strdup (__IDL_text + 1); __IDL_lval.str[strlen (__IDL_lval.str) - 1] = 0; tokreturn (TOK_PROP_VALUE); } YY_BREAK case 62: YY_RULE_SETUP #line 266 "lexer.l" { __IDL_lval.str = g_strdup (__IDL_text); __IDL_lval.str[strlen (__IDL_lval.str) - 1] = 0; tokreturn (TOK_NATIVE_TYPE); } YY_BREAK case 63: YY_RULE_SETUP #line 271 "lexer.l" { __IDL_lval.str = g_strdup (__IDL_text + 1); __IDL_lval.str[strlen (__IDL_text) - 2] = 0; tokreturn (TOK_SQSTRING); } YY_BREAK case 64: YY_RULE_SETUP #line 276 "lexer.l" { __IDL_lval.str = g_strdup (__IDL_text + 1); __IDL_lval.str[strlen (__IDL_text) - 2] = 0; tokreturn (TOK_DQSTRING); } YY_BREAK case 65: YY_RULE_SETUP #line 281 "lexer.l" ++__IDL_cur_line; YY_BREAK case 66: YY_RULE_SETUP #line 282 "lexer.l" YY_BREAK case 67: YY_RULE_SETUP #line 283 "lexer.l" tokreturn (__IDL_text[0]); YY_BREAK case 68: YY_RULE_SETUP #line 285 "lexer.l" ECHO; YY_BREAK case YY_STATE_EOF(INITIAL): case YY_STATE_EOF(XPIDL): case YY_STATE_EOF(XPIDLPROP): case YY_STATE_EOF(XPIDLNATIVE): case YY_STATE_EOF(XPIDLCODEFRAGX): __IDL_terminate(); case YY_END_OF_BUFFER: { /* Amount of text matched not including the EOB char. */ int __IDL__amount_of_matched_text = (int) (__IDL__cp - __IDL_text_ptr) - 1; /* Undo the effects of YY_DO_BEFORE_ACTION. */ *__IDL__cp = __IDL__hold_char; YY_RESTORE_YY_MORE_OFFSET if ( __IDL__current_buffer->__IDL__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 __IDL_in at a new source and called * __IDL_lex(). If so, then we have to assure * consistency between __IDL__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. */ __IDL__n_chars = __IDL__current_buffer->__IDL__n_chars; __IDL__current_buffer->__IDL__input_file = __IDL_in; __IDL__current_buffer->__IDL__buffer_status = YY_BUFFER_NORMAL; } /* Note that here we test for __IDL__c_buf_p "<=" to the position * of the first EOB in the buffer, since __IDL__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 ( __IDL__c_buf_p <= &__IDL__current_buffer->__IDL__ch_buf[__IDL__n_chars] ) { /* This was really a NUL. */ __IDL__state_type __IDL__next_state; __IDL__c_buf_p = __IDL_text_ptr + __IDL__amount_of_matched_text; __IDL__current_state = __IDL__get_previous_state(); /* Okay, we're now positioned to make the NUL * transition. We couldn't have * __IDL__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). */ __IDL__next_state = __IDL__try_NUL_trans( __IDL__current_state ); __IDL__bp = __IDL_text_ptr + YY_MORE_ADJ; if ( __IDL__next_state ) { /* Consume the NUL. */ __IDL__cp = ++__IDL__c_buf_p; __IDL__current_state = __IDL__next_state; goto __IDL__match; } else { __IDL__cp = __IDL__c_buf_p; goto __IDL__find_action; } } else switch ( __IDL__get_next_buffer() ) { case EOB_ACT_END_OF_FILE: { __IDL__did_buffer_switch_on_eof = 0; if ( __IDL_wrap() ) { /* Note: because we've taken care in * __IDL__get_next_buffer() to have set up * __IDL_text, we can now set up * __IDL__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. */ __IDL__c_buf_p = __IDL_text_ptr + YY_MORE_ADJ; __IDL__act = YY_STATE_EOF(YY_START); goto do_action; } else { if ( ! __IDL__did_buffer_switch_on_eof ) YY_NEW_FILE; } break; } case EOB_ACT_CONTINUE_SCAN: __IDL__c_buf_p = __IDL_text_ptr + __IDL__amount_of_matched_text; __IDL__current_state = __IDL__get_previous_state(); __IDL__cp = __IDL__c_buf_p; __IDL__bp = __IDL_text_ptr + YY_MORE_ADJ; goto __IDL__match; case EOB_ACT_LAST_MATCH: __IDL__c_buf_p = &__IDL__current_buffer->__IDL__ch_buf[__IDL__n_chars]; __IDL__current_state = __IDL__get_previous_state(); __IDL__cp = __IDL__c_buf_p; __IDL__bp = __IDL_text_ptr + YY_MORE_ADJ; goto __IDL__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 __IDL_lex */ /* __IDL__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 __IDL__get_next_buffer() { register char *dest = __IDL__current_buffer->__IDL__ch_buf; register char *source = __IDL_text_ptr; register int number_to_move, i; int ret_val; if ( __IDL__c_buf_p > &__IDL__current_buffer->__IDL__ch_buf[__IDL__n_chars + 1] ) YY_FATAL_ERROR( "fatal flex scanner internal error--end of buffer missed" ); if ( __IDL__current_buffer->__IDL__fill_buffer == 0 ) { /* Don't try to fill the buffer, so this is an EOF. */ if ( __IDL__c_buf_p - __IDL_text_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) (__IDL__c_buf_p - __IDL_text_ptr) - 1; for ( i = 0; i < number_to_move; ++i ) *(dest++) = *(source++); if ( __IDL__current_buffer->__IDL__buffer_status == YY_BUFFER_EOF_PENDING ) /* don't do the read, it's not guaranteed to return an EOF, * just force an EOF */ __IDL__current_buffer->__IDL__n_chars = __IDL__n_chars = 0; else { int num_to_read = __IDL__current_buffer->__IDL__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 = __IDL__current_buffer; int __IDL__c_buf_p_offset = (int) (__IDL__c_buf_p - b->__IDL__ch_buf); if ( b->__IDL__is_our_buffer ) { int new_size = b->__IDL__buf_size * 2; if ( new_size <= 0 ) b->__IDL__buf_size += b->__IDL__buf_size / 8; else b->__IDL__buf_size *= 2; b->__IDL__ch_buf = (char *) /* Include room in for 2 EOB chars. */ __IDL__flex_realloc( (void *) b->__IDL__ch_buf, b->__IDL__buf_size + 2 ); } else /* Can't grow it, we don't own it. */ b->__IDL__ch_buf = 0; if ( ! b->__IDL__ch_buf ) YY_FATAL_ERROR( "fatal error - scanner input buffer overflow" ); __IDL__c_buf_p = &b->__IDL__ch_buf[__IDL__c_buf_p_offset]; num_to_read = __IDL__current_buffer->__IDL__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( (&__IDL__current_buffer->__IDL__ch_buf[number_to_move]), __IDL__n_chars, num_to_read ); __IDL__current_buffer->__IDL__n_chars = __IDL__n_chars; } if ( __IDL__n_chars == 0 ) { if ( number_to_move == YY_MORE_ADJ ) { ret_val = EOB_ACT_END_OF_FILE; __IDL_restart( __IDL_in ); } else { ret_val = EOB_ACT_LAST_MATCH; __IDL__current_buffer->__IDL__buffer_status = YY_BUFFER_EOF_PENDING; } } else ret_val = EOB_ACT_CONTINUE_SCAN; __IDL__n_chars += number_to_move; __IDL__current_buffer->__IDL__ch_buf[__IDL__n_chars] = YY_END_OF_BUFFER_CHAR; __IDL__current_buffer->__IDL__ch_buf[__IDL__n_chars + 1] = YY_END_OF_BUFFER_CHAR; __IDL_text_ptr = &__IDL__current_buffer->__IDL__ch_buf[0]; return ret_val; } /* __IDL__get_previous_state - get the state just before the EOB char was reached */ static __IDL__state_type __IDL__get_previous_state() { register __IDL__state_type __IDL__current_state; register char *__IDL__cp; __IDL__current_state = __IDL__start; __IDL__current_state += YY_AT_BOL(); for ( __IDL__cp = __IDL_text_ptr + YY_MORE_ADJ; __IDL__cp < __IDL__c_buf_p; ++__IDL__cp ) { register YY_CHAR __IDL__c = (*__IDL__cp ? __IDL__ec[YY_SC_TO_UI(*__IDL__cp)] : 1); if ( __IDL__accept[__IDL__current_state] ) { __IDL__last_accepting_state = __IDL__current_state; __IDL__last_accepting_cpos = __IDL__cp; } while ( __IDL__chk[__IDL__base[__IDL__current_state] + __IDL__c] != __IDL__current_state ) { __IDL__current_state = (int) __IDL__def[__IDL__current_state]; if ( __IDL__current_state >= 378 ) __IDL__c = __IDL__meta[(unsigned int) __IDL__c]; } __IDL__current_state = __IDL__nxt[__IDL__base[__IDL__current_state] + (unsigned int) __IDL__c]; } return __IDL__current_state; } /* __IDL__try_NUL_trans - try to make a transition on the NUL character * * synopsis * next_state = __IDL__try_NUL_trans( current_state ); */ #ifdef YY_USE_PROTOS static __IDL__state_type __IDL__try_NUL_trans( __IDL__state_type __IDL__current_state ) #else static __IDL__state_type __IDL__try_NUL_trans( __IDL__current_state ) __IDL__state_type __IDL__current_state; #endif { register int __IDL__is_jam; register char *__IDL__cp = __IDL__c_buf_p; register YY_CHAR __IDL__c = 1; if ( __IDL__accept[__IDL__current_state] ) { __IDL__last_accepting_state = __IDL__current_state; __IDL__last_accepting_cpos = __IDL__cp; } while ( __IDL__chk[__IDL__base[__IDL__current_state] + __IDL__c] != __IDL__current_state ) { __IDL__current_state = (int) __IDL__def[__IDL__current_state]; if ( __IDL__current_state >= 378 ) __IDL__c = __IDL__meta[(unsigned int) __IDL__c]; } __IDL__current_state = __IDL__nxt[__IDL__base[__IDL__current_state] + (unsigned int) __IDL__c]; __IDL__is_jam = (__IDL__current_state == 377); return __IDL__is_jam ? 0 : __IDL__current_state; } #ifndef YY_NO_UNPUT #ifdef YY_USE_PROTOS static void __IDL_unput( int c, register char *__IDL__bp ) #else static void __IDL_unput( c, __IDL__bp ) int c; register char *__IDL__bp; #endif { register char *__IDL__cp = __IDL__c_buf_p; /* undo effects of setting up __IDL_text */ *__IDL__cp = __IDL__hold_char; if ( __IDL__cp < __IDL__current_buffer->__IDL__ch_buf + 2 ) { /* need to shift things up to make room */ /* +2 for EOB chars. */ register int number_to_move = __IDL__n_chars + 2; register char *dest = &__IDL__current_buffer->__IDL__ch_buf[ __IDL__current_buffer->__IDL__buf_size + 2]; register char *source = &__IDL__current_buffer->__IDL__ch_buf[number_to_move]; while ( source > __IDL__current_buffer->__IDL__ch_buf ) *--dest = *--source; __IDL__cp += (int) (dest - source); __IDL__bp += (int) (dest - source); __IDL__current_buffer->__IDL__n_chars = __IDL__n_chars = __IDL__current_buffer->__IDL__buf_size; if ( __IDL__cp < __IDL__current_buffer->__IDL__ch_buf + 2 ) YY_FATAL_ERROR( "flex scanner push-back overflow" ); } *--__IDL__cp = (char) c; __IDL_text_ptr = __IDL__bp; __IDL__hold_char = *__IDL__cp; __IDL__c_buf_p = __IDL__cp; } #endif /* ifndef YY_NO_UNPUT */ #ifdef __cplusplus static int __IDL_input() #else static int input() #endif { int c; *__IDL__c_buf_p = __IDL__hold_char; if ( *__IDL__c_buf_p == YY_END_OF_BUFFER_CHAR ) { /* __IDL__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 ( __IDL__c_buf_p < &__IDL__current_buffer->__IDL__ch_buf[__IDL__n_chars] ) /* This was really a NUL. */ *__IDL__c_buf_p = '\0'; else { /* need more input */ int offset = __IDL__c_buf_p - __IDL_text_ptr; ++__IDL__c_buf_p; switch ( __IDL__get_next_buffer() ) { case EOB_ACT_LAST_MATCH: /* This happens because __IDL__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. */ __IDL_restart( __IDL_in ); /* fall through */ case EOB_ACT_END_OF_FILE: { if ( __IDL_wrap() ) return EOF; if ( ! __IDL__did_buffer_switch_on_eof ) YY_NEW_FILE; #ifdef __cplusplus return __IDL_input(); #else return input(); #endif } case EOB_ACT_CONTINUE_SCAN: __IDL__c_buf_p = __IDL_text_ptr + offset; break; } } } c = *(unsigned char *) __IDL__c_buf_p; /* cast for 8-bit char's */ *__IDL__c_buf_p = '\0'; /* preserve __IDL_text */ __IDL__hold_char = *++__IDL__c_buf_p; __IDL__current_buffer->__IDL__at_bol = (c == '\n'); return c; } #ifdef YY_USE_PROTOS void __IDL_restart( FILE *input_file ) #else void __IDL_restart( input_file ) FILE *input_file; #endif { if ( ! __IDL__current_buffer ) __IDL__current_buffer = __IDL__create_buffer( __IDL_in, YY_BUF_SIZE ); __IDL__init_buffer( __IDL__current_buffer, input_file ); __IDL__load_buffer_state(); } #ifdef YY_USE_PROTOS void __IDL__switch_to_buffer( YY_BUFFER_STATE new_buffer ) #else void __IDL__switch_to_buffer( new_buffer ) YY_BUFFER_STATE new_buffer; #endif { if ( __IDL__current_buffer == new_buffer ) return; if ( __IDL__current_buffer ) { /* Flush out information for old buffer. */ *__IDL__c_buf_p = __IDL__hold_char; __IDL__current_buffer->__IDL__buf_pos = __IDL__c_buf_p; __IDL__current_buffer->__IDL__n_chars = __IDL__n_chars; } __IDL__current_buffer = new_buffer; __IDL__load_buffer_state(); /* We don't actually know whether we did this switch during * EOF (__IDL_wrap()) processing, but the only time this flag * is looked at is after __IDL_wrap() is called, so it's safe * to go ahead and always set it. */ __IDL__did_buffer_switch_on_eof = 1; } #ifdef YY_USE_PROTOS void __IDL__load_buffer_state( void ) #else void __IDL__load_buffer_state() #endif { __IDL__n_chars = __IDL__current_buffer->__IDL__n_chars; __IDL_text_ptr = __IDL__c_buf_p = __IDL__current_buffer->__IDL__buf_pos; __IDL_in = __IDL__current_buffer->__IDL__input_file; __IDL__hold_char = *__IDL__c_buf_p; } #ifdef YY_USE_PROTOS YY_BUFFER_STATE __IDL__create_buffer( FILE *file, int size ) #else YY_BUFFER_STATE __IDL__create_buffer( file, size ) FILE *file; int size; #endif { YY_BUFFER_STATE b; b = (YY_BUFFER_STATE) __IDL__flex_alloc( sizeof( struct __IDL__buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in __IDL__create_buffer()" ); b->__IDL__buf_size = size; /* __IDL__ch_buf has to be 2 characters longer than the size given because * we need to put in 2 end-of-buffer characters. */ b->__IDL__ch_buf = (char *) __IDL__flex_alloc( b->__IDL__buf_size + 2 ); if ( ! b->__IDL__ch_buf ) YY_FATAL_ERROR( "out of dynamic memory in __IDL__create_buffer()" ); b->__IDL__is_our_buffer = 1; __IDL__init_buffer( b, file ); return b; } #ifdef YY_USE_PROTOS void __IDL__delete_buffer( YY_BUFFER_STATE b ) #else void __IDL__delete_buffer( b ) YY_BUFFER_STATE b; #endif { if ( ! b ) return; if ( b == __IDL__current_buffer ) __IDL__current_buffer = (YY_BUFFER_STATE) 0; if ( b->__IDL__is_our_buffer ) __IDL__flex_free( (void *) b->__IDL__ch_buf ); __IDL__flex_free( (void *) b ); } #ifndef YY_ALWAYS_INTERACTIVE #ifndef YY_NEVER_INTERACTIVE extern int isatty YY_PROTO(( int )); #endif #endif #ifdef YY_USE_PROTOS void __IDL__init_buffer( YY_BUFFER_STATE b, FILE *file ) #else void __IDL__init_buffer( b, file ) YY_BUFFER_STATE b; FILE *file; #endif { __IDL__flush_buffer( b ); b->__IDL__input_file = file; b->__IDL__fill_buffer = 1; #if YY_ALWAYS_INTERACTIVE b->__IDL__is_interactive = 1; #else #if YY_NEVER_INTERACTIVE b->__IDL__is_interactive = 0; #else b->__IDL__is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; #endif #endif } #ifdef YY_USE_PROTOS void __IDL__flush_buffer( YY_BUFFER_STATE b ) #else void __IDL__flush_buffer( b ) YY_BUFFER_STATE b; #endif { if ( ! b ) return; b->__IDL__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->__IDL__ch_buf[0] = YY_END_OF_BUFFER_CHAR; b->__IDL__ch_buf[1] = YY_END_OF_BUFFER_CHAR; b->__IDL__buf_pos = &b->__IDL__ch_buf[0]; b->__IDL__at_bol = 1; b->__IDL__buffer_status = YY_BUFFER_NEW; if ( b == __IDL__current_buffer ) __IDL__load_buffer_state(); } #ifndef YY_NO_SCAN_BUFFER #ifdef YY_USE_PROTOS YY_BUFFER_STATE __IDL__scan_buffer( char *base, __IDL__size_t size ) #else YY_BUFFER_STATE __IDL__scan_buffer( base, size ) char *base; __IDL__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) __IDL__flex_alloc( sizeof( struct __IDL__buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in __IDL__scan_buffer()" ); b->__IDL__buf_size = size - 2; /* "- 2" to take care of EOB's */ b->__IDL__buf_pos = b->__IDL__ch_buf = base; b->__IDL__is_our_buffer = 0; b->__IDL__input_file = 0; b->__IDL__n_chars = b->__IDL__buf_size; b->__IDL__is_interactive = 0; b->__IDL__at_bol = 1; b->__IDL__fill_buffer = 0; b->__IDL__buffer_status = YY_BUFFER_NEW; __IDL__switch_to_buffer( b ); return b; } #endif #ifndef YY_NO_SCAN_STRING #ifdef YY_USE_PROTOS YY_BUFFER_STATE __IDL__scan_string( __IDL_const char *__IDL__str ) #else YY_BUFFER_STATE __IDL__scan_string( __IDL__str ) __IDL_const char *__IDL__str; #endif { int len; for ( len = 0; __IDL__str[len]; ++len ) ; return __IDL__scan_bytes( __IDL__str, len ); } #endif #ifndef YY_NO_SCAN_BYTES #ifdef YY_USE_PROTOS YY_BUFFER_STATE __IDL__scan_bytes( __IDL_const char *bytes, int len ) #else YY_BUFFER_STATE __IDL__scan_bytes( bytes, len ) __IDL_const char *bytes; int len; #endif { YY_BUFFER_STATE b; char *buf; __IDL__size_t n; int i; /* Get memory for full buffer, including space for trailing EOB's. */ n = len + 2; buf = (char *) __IDL__flex_alloc( n ); if ( ! buf ) YY_FATAL_ERROR( "out of dynamic memory in __IDL__scan_bytes()" ); for ( i = 0; i < len; ++i ) buf[i] = bytes[i]; buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR; b = __IDL__scan_buffer( buf, n ); if ( ! b ) YY_FATAL_ERROR( "bad buffer in __IDL__scan_bytes()" ); /* It's okay to grow etc. this buffer, and we should throw it * away when we're done. */ b->__IDL__is_our_buffer = 1; return b; } #endif #ifndef YY_NO_PUSH_STATE #ifdef YY_USE_PROTOS static void __IDL__push_state( int new_state ) #else static void __IDL__push_state( new_state ) int new_state; #endif { if ( __IDL__start_stack_ptr >= __IDL__start_stack_depth ) { __IDL__size_t new_size; __IDL__start_stack_depth += YY_START_STACK_INCR; new_size = __IDL__start_stack_depth * sizeof( int ); if ( ! __IDL__start_stack ) __IDL__start_stack = (int *) __IDL__flex_alloc( new_size ); else __IDL__start_stack = (int *) __IDL__flex_realloc( (void *) __IDL__start_stack, new_size ); if ( ! __IDL__start_stack ) YY_FATAL_ERROR( "out of memory expanding start-condition stack" ); } __IDL__start_stack[__IDL__start_stack_ptr++] = YY_START; BEGIN(new_state); } #endif #ifndef YY_NO_POP_STATE static void __IDL__pop_state() { if ( --__IDL__start_stack_ptr < 0 ) YY_FATAL_ERROR( "start-condition stack underflow" ); BEGIN(__IDL__start_stack[__IDL__start_stack_ptr]); } #endif #ifndef YY_NO_TOP_STATE static int __IDL__top_state() { return __IDL__start_stack[__IDL__start_stack_ptr - 1]; } #endif #ifndef YY_EXIT_FAILURE #define YY_EXIT_FAILURE 2 #endif #ifdef YY_USE_PROTOS static void __IDL__fatal_error( __IDL_const char msg[] ) #else static void __IDL__fatal_error( msg ) char msg[]; #endif { (void) fprintf( stderr, "%s\n", msg ); exit( YY_EXIT_FAILURE ); } /* Redefine __IDL_less() so it works in section 3 code. */ #undef __IDL_less #define __IDL_less(n) \ do \ { \ /* Undo effects of setting up __IDL_text. */ \ __IDL_text[__IDL_leng] = __IDL__hold_char; \ __IDL__c_buf_p = __IDL_text + n; \ __IDL__hold_char = *__IDL__c_buf_p; \ *__IDL__c_buf_p = '\0'; \ __IDL_leng = n; \ } \ while ( 0 ) /* Internal utility routines. */ #ifndef __IDL_text_ptr #ifdef YY_USE_PROTOS static void __IDL__flex_strncpy( char *s1, __IDL_const char *s2, int n ) #else static void __IDL__flex_strncpy( s1, s2, n ) char *s1; __IDL_const 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 __IDL__flex_strlen( __IDL_const char *s ) #else static int __IDL__flex_strlen( s ) __IDL_const char *s; #endif { register int n; for ( n = 0; s[n]; ++n ) ; return n; } #endif #ifdef YY_USE_PROTOS static void *__IDL__flex_alloc( __IDL__size_t size ) #else static void *__IDL__flex_alloc( size ) __IDL__size_t size; #endif { return (void *) malloc( size ); } #ifdef YY_USE_PROTOS static void *__IDL__flex_realloc( void *ptr, __IDL__size_t size ) #else static void *__IDL__flex_realloc( ptr, size ) void *ptr; __IDL__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 __IDL__flex_free( void *ptr ) #else static void __IDL__flex_free( ptr ) void *ptr; #endif { free( ptr ); } #if YY_MAIN int main() { __IDL_lex(); return 0; } #endif #line 285 "lexer.l" void __IDL_lex_init (void) { __IDL_inputcb = NULL; __IDL_cur_line = 1; __IDL_cur_token_line = 0; __IDL_prev_token_line = 0; __IDL_cur_filename = NULL; __IDL_cur_fileinfo = NULL; warn_underscores = 0; } void __IDL_lex_cleanup (void) { __IDL_cur_filename = NULL; } int __IDL_wrap (void) { return 1; } /* * Local variables: * mode: C * c-basic-offset: 8 * tab-width: 8 * indent-tabs-mode: t * End: */