Google Git
Sign in
llvm / llvm-project / refs/heads/release/1.8.x / . / llvm / lib / AsmParser / Lexer.cpp.cvs
blob: a76a502a66ab5de793571f7b1ff4e6342dc78361 [file] [log] [blame]
#define yy_create_buffer llvmAsm_create_buffer
#define yy_delete_buffer llvmAsm_delete_buffer
#define yy_scan_buffer llvmAsm_scan_buffer
#define yy_scan_string llvmAsm_scan_string
#define yy_scan_bytes llvmAsm_scan_bytes
#define yy_flex_debug llvmAsm_flex_debug
#define yy_init_buffer llvmAsm_init_buffer
#define yy_flush_buffer llvmAsm_flush_buffer
#define yy_load_buffer_state llvmAsm_load_buffer_state
#define yy_switch_to_buffer llvmAsm_switch_to_buffer
#define yyin llvmAsmin
#define yyleng llvmAsmleng
#define yylex llvmAsmlex
#define yyout llvmAsmout
#define yyrestart llvmAsmrestart
#define yytext llvmAsmtext
#define yylineno llvmAsmlineno
#line 20 "Lexer.cpp"
/* A lexical scanner generated by flex */
/* Scanner skeleton version:
* $Header$
*/
#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 5
#include <stdio.h>
/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
#ifdef c_plusplus
#ifndef __cplusplus
#define __cplusplus
#endif
#endif
#ifdef __cplusplus
#include <stdlib.h>
#include <unistd.h>
/* Use prototypes in function declarations. */
#define YY_USE_PROTOS
/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST
#else /* ! __cplusplus */
#if __STDC__
#define YY_USE_PROTOS
#define YY_USE_CONST
#endif /* __STDC__ */
#endif /* ! __cplusplus */
#ifdef __TURBOC__
#pragma warn -rch
#pragma warn -use
#include <io.h>
#include <stdlib.h>
#define YY_USE_CONST
#define YY_USE_PROTOS
#endif
#ifdef YY_USE_CONST
#define yyconst const
#else
#define yyconst
#endif
#ifdef YY_USE_PROTOS
#define YY_PROTO(proto) proto
#else
#define YY_PROTO(proto) ()
#endif
/* Returned upon end-of-file. */
#define YY_NULL 0
/* Promotes a possibly negative, possibly signed char to an unsigned
* integer for use as an array index. If the signed char is negative,
* we want to instead treat it as an 8-bit unsigned char, hence the
* double cast.
*/
#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
/* Enter a start condition. This macro really ought to take a parameter,
* but we do it the disgusting crufty way forced on us by the ()-less
* definition of BEGIN.
*/
#define BEGIN yy_start = 1 + 2 *
/* Translate the current start state into a value that can be later handed
* to BEGIN to return to the state. The YYSTATE alias is for lex
* compatibility.
*/
#define YY_START ((yy_start - 1) / 2)
#define YYSTATE YY_START
/* Action number for EOF rule of a given start state. */
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
/* Special action meaning "start processing a new file". */
#define YY_NEW_FILE yyrestart( yyin )
#define YY_END_OF_BUFFER_CHAR 0
/* Size of default input buffer. */
#define YY_BUF_SIZE (16384*64)
typedef struct yy_buffer_state *YY_BUFFER_STATE;
extern int yyleng;
extern FILE *yyin, *yyout;
#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2
/* The funky do-while in the following #define is used to turn the definition
* int a single C statement (which needs a semi-colon terminator). This
* avoids problems with code like:
*
* if ( condition_holds )
* yyless( 5 );
* else
* do_something_else();
*
* Prior to using the do-while the compiler would get upset at the
* "else" because it interpreted the "if" statement as being all
* done when it reached the ';' after the yyless() call.
*/
/* Return all but the first 'n' matched characters back to the input stream. */
#define yyless(n) \
do \
{ \
/* Undo effects of setting up yytext. */ \
*yy_cp = yy_hold_char; \
YY_RESTORE_YY_MORE_OFFSET \
yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \
YY_DO_BEFORE_ACTION; /* set up yytext again */ \
} \
while ( 0 )
#define unput(c) yyunput( c, yytext_ptr )
/* The following is because we cannot portably get our hands on size_t
* (without autoconf's help, which isn't available because we want
* flex-generated scanners to compile on their own).
*/
typedef unsigned int yy_size_t;
struct yy_buffer_state
{
FILE *yy_input_file;
char *yy_ch_buf; /* input buffer */
char *yy_buf_pos; /* current position in input buffer */
/* Size of input buffer in bytes, not including room for EOB
* characters.
*/
yy_size_t yy_buf_size;
/* Number of characters read into yy_ch_buf, not including EOB
* characters.
*/
int yy_n_chars;
/* Whether we "own" the buffer - i.e., we know we created it,
* and can realloc() it to grow it, and should free() it to
* delete it.
*/
int yy_is_our_buffer;
/* Whether this is an "interactive" input source; if so, and
* if we're using stdio for input, then we want to use getc()
* instead of fread(), to make sure we stop fetching input after
* each newline.
*/
int yy_is_interactive;
/* Whether we're considered to be at the beginning of a line.
* If so, '^' rules will be active on the next match, otherwise
* not.
*/
int yy_at_bol;
/* Whether to try to fill the input buffer when we reach the
* end of it.
*/
int yy_fill_buffer;
int yy_buffer_status;
#define YY_BUFFER_NEW 0
#define YY_BUFFER_NORMAL 1
/* When an EOF's been seen but there's still some text to process
* then we mark the buffer as YY_EOF_PENDING, to indicate that we
* shouldn't try reading from the input source any more. We might
* still have a bunch of tokens to match, though, because of
* possible backing-up.
*
* When we actually see the EOF, we change the status to "new"
* (via yyrestart()), so that the user can continue scanning by
* just pointing yyin at a new input file.
*/
#define YY_BUFFER_EOF_PENDING 2
};
static YY_BUFFER_STATE yy_current_buffer = 0;
/* We provide macros for accessing buffer states in case in the
* future we want to put the buffer states in a more general
* "scanner state".
*/
#define YY_CURRENT_BUFFER yy_current_buffer
/* yy_hold_char holds the character lost when yytext is formed. */
static char yy_hold_char;
static int yy_n_chars; /* number of characters read into yy_ch_buf */
int yyleng;
/* Points to current character in buffer. */
static char *yy_c_buf_p = (char *) 0;
static int yy_init = 1; /* whether we need to initialize */
static int yy_start = 0; /* start state number */
/* Flag which is used to allow yywrap()'s to do buffer switches
* instead of setting up a fresh yyin. A bit of a hack ...
*/
static int yy_did_buffer_switch_on_eof;
void yyrestart YY_PROTO(( FILE *input_file ));
void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
void yy_load_buffer_state YY_PROTO(( void ));
YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size ));
void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer )
YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size ));
YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str ));
YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len ));
static void *yy_flex_alloc YY_PROTO(( yy_size_t ));
static inline void *yy_flex_realloc YY_PROTO(( void *, yy_size_t ));
static void yy_flex_free YY_PROTO(( void * ));
#define yy_new_buffer yy_create_buffer
#define yy_set_interactive(is_interactive) \
{ \
if ( ! yy_current_buffer ) \
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
yy_current_buffer->yy_is_interactive = is_interactive; \
}
#define yy_set_bol(at_bol) \
{ \
if ( ! yy_current_buffer ) \
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
yy_current_buffer->yy_at_bol = at_bol; \
}
#define YY_AT_BOL() (yy_current_buffer->yy_at_bol)
#define YY_USES_REJECT
#define yywrap() 1
#define YY_SKIP_YYWRAP
typedef unsigned char YY_CHAR;
FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
typedef int yy_state_type;
extern int yylineno;
int yylineno = 1;
extern char *yytext;
#define yytext_ptr yytext
static yy_state_type yy_get_previous_state YY_PROTO(( void ));
static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state ));
static int yy_get_next_buffer YY_PROTO(( void ));
static void yy_fatal_error YY_PROTO(( yyconst char msg[] ));
/* Done after the current pattern has been matched and before the
* corresponding action - sets up yytext.
*/
#define YY_DO_BEFORE_ACTION \
yytext_ptr = yy_bp; \
yyleng = (int) (yy_cp - yy_bp); \
yy_hold_char = *yy_cp; \
*yy_cp = '\0'; \
yy_c_buf_p = yy_cp;
#define YY_NUM_RULES 108
#define YY_END_OF_BUFFER 109
static yyconst short int yy_acclist[186] =
{ 0,
109, 107, 108, 106, 107, 108, 106, 108, 107, 108,
107, 108, 107, 108, 107, 108, 107, 108, 107, 108,
99, 107, 108, 99, 107, 108, 1, 107, 108, 107,
108, 107, 108, 107, 108, 107, 108, 107, 108, 107,
108, 107, 108, 107, 108, 107, 108, 107, 108, 107,
108, 107, 108, 107, 108, 107, 108, 107, 108, 107,
108, 107, 108, 107, 108, 107, 108, 107, 108, 107,
108, 98, 96, 95, 95, 102, 100, 104, 99, 1,
81, 37, 63, 20, 98, 95, 95, 103, 104, 17,
104, 105, 57, 62, 35, 30, 38, 60, 3, 48,
59, 22, 71, 61, 80, 75, 76, 58, 64, 97,
104, 104, 43, 72, 73, 88, 89, 50, 19, 101,
23, 4, 55, 49, 42, 11, 104, 32, 2, 5,
52, 54, 44, 66, 70, 68, 69, 67, 65, 46,
90, 45, 51, 18, 78, 87, 41, 53, 27, 21,
40, 7, 83, 29, 86, 34, 56, 74, 82, 24,
25, 84, 47, 79, 77, 39, 6, 26, 33, 8,
14, 9, 10, 31, 12, 36, 28, 85, 91, 93,
94, 13, 92, 15, 16
} ;
static yyconst short int yy_accept[461] =
{ 0,
1, 1, 1, 2, 4, 7, 9, 11, 13, 15,
17, 19, 21, 24, 27, 30, 32, 34, 36, 38,
40, 42, 44, 46, 48, 50, 52, 54, 56, 58,
60, 62, 64, 66, 68, 70, 72, 72, 73, 73,
74, 75, 76, 77, 77, 78, 78, 79, 80, 80,
81, 81, 81, 81, 81, 81, 81, 81, 81, 82,
82, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 83, 83, 83, 83, 84, 84, 84, 84, 84,
84, 84, 84, 84, 84, 84, 84, 84, 85, 85,
85, 85, 85, 85, 85, 85, 85, 85, 85, 85,
85, 86, 87, 89, 90, 91, 92, 92, 93, 94,
94, 94, 95, 95, 96, 96, 97, 97, 97, 97,
98, 98, 98, 98, 98, 98, 99, 99, 100, 100,
100, 100, 100, 100, 100, 100, 100, 100, 100, 101,
101, 101, 101, 101, 101, 101, 101, 101, 102, 103,
103, 103, 104, 104, 105, 106, 106, 106, 106, 106,
106, 107, 107, 108, 108, 108, 108, 109, 109, 109,
109, 109, 109, 109, 109, 109, 109, 109, 109, 109,
109, 109, 109, 109, 109, 109, 109, 109, 110, 110,
111, 112, 112, 112, 112, 113, 113, 113, 113, 113,
114, 115, 116, 116, 116, 116, 116, 116, 116, 116,
116, 116, 116, 116, 116, 116, 117, 117, 117, 117,
117, 117, 117, 117, 117, 117, 118, 119, 119, 119,
120, 120, 120, 121, 121, 121, 121, 121, 121, 121,
121, 121, 121, 121, 121, 121, 122, 122, 122, 123,
124, 124, 125, 125, 125, 125, 125, 125, 125, 125,
125, 125, 126, 126, 127, 127, 128, 129, 129, 129,
130, 130, 130, 130, 130, 130, 130, 130, 130, 130,
130, 131, 131, 132, 132, 132, 132, 132, 132, 132,
133, 133, 133, 133, 133, 133, 133, 134, 134, 134,
135, 136, 137, 138, 139, 140, 141, 141, 141, 142,
142, 142, 142, 143, 144, 145, 145, 145, 145, 145,
145, 146, 146, 146, 146, 147, 147, 148, 148, 148,
148, 148, 149, 150, 151, 151, 151, 152, 152, 153,
153, 153, 153, 154, 154, 155, 156, 157, 158, 158,
158, 159, 159, 159, 160, 161, 162, 162, 162, 163,
164, 165, 166, 166, 166, 166, 166, 167, 168, 169,
169, 169, 169, 169, 169, 169, 169, 169, 170, 170,
170, 170, 170, 170, 170, 170, 171, 172, 172, 172,
172, 172, 173, 174, 174, 174, 174, 174, 174, 175,
175, 176, 176, 176, 176, 176, 176, 176, 176, 176,
176, 176, 176, 176, 176, 176, 176, 176, 177, 177,
177, 177, 177, 177, 177, 177, 178, 178, 178, 179,
179, 179, 179, 179, 179, 179, 179, 179, 179, 180,
180, 181, 182, 183, 183, 184, 185, 185, 186, 186
} ;
static yyconst int yy_ec[256] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
1, 1, 2, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 2, 1, 4, 1, 5, 6, 1, 1, 1,
1, 1, 7, 1, 8, 9, 1, 10, 11, 11,
11, 11, 11, 11, 11, 11, 11, 12, 13, 1,
1, 1, 1, 1, 14, 14, 14, 14, 15, 14,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
1, 1, 1, 1, 16, 1, 17, 18, 19, 20,
21, 22, 23, 24, 25, 5, 26, 27, 28, 29,
30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
40, 41, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1
} ;
static yyconst int yy_meta[42] =
{ 0,
1, 1, 2, 1, 3, 1, 1, 3, 3, 3,
3, 4, 1, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3
} ;
static yyconst short int yy_base[465] =
{ 0,
0, 0, 960, 961, 961, 961, 955, 946, 34, 36,
38, 42, 46, 50, 0, 52, 57, 54, 68, 62,
80, 82, 83, 93, 102, 40, 84, 92, 56, 129,
112, 158, 113, 87, 90, 114, 953, 961, 944, 961,
0, 117, 123, 146, 149, 128, 163, 170, 183, 0,
55, 119, 151, 157, 178, 139, 154, 177, 943, 184,
196, 187, 88, 198, 197, 136, 200, 207, 201, 209,
210, 211, 213, 218, 220, 215, 212, 233, 224, 228,
225, 226, 232, 174, 942, 124, 241, 244, 246, 248,
251, 257, 253, 252, 256, 255, 264, 941, 269, 265,
259, 263, 271, 283, 41, 290, 286, 292, 279, 298,
940, 0, 304, 307, 939, 314, 326, 0, 938, 318,
315, 937, 311, 936, 327, 935, 328, 330, 308, 934,
334, 332, 335, 336, 337, 933, 341, 346, 339, 349,
338, 350, 356, 353, 355, 357, 365, 366, 367, 368,
369, 371, 372, 374, 377, 379, 381, 932, 931, 383,
31, 930, 384, 929, 928, 408, 389, 396, 390, 420,
927, 387, 926, 392, 391, 403, 925, 404, 421, 422,
409, 423, 425, 426, 430, 438, 439, 440, 441, 443,
442, 446, 444, 445, 458, 447, 459, 924, 461, 961,
465, 482, 471, 484, 487, 471, 489, 475, 476, 923,
922, 921, 490, 472, 491, 462, 494, 498, 499, 500,
501, 503, 502, 505, 506, 920, 509, 510, 516, 517,
518, 520, 521, 523, 527, 919, 918, 526, 528, 917,
530, 532, 0, 531, 533, 545, 537, 547, 549, 550,
548, 551, 553, 560, 566, 916, 565, 563, 915, 914,
567, 913, 564, 577, 568, 579, 580, 582, 583, 585,
586, 912, 588, 911, 589, 592, 910, 593, 592, 909,
594, 605, 599, 595, 608, 609, 607, 612, 615, 619,
908, 620, 907, 621, 622, 617, 623, 625, 629, 906,
628, 631, 634, 639, 643, 644, 905, 636, 647, 904,
903, 902, 901, 900, 899, 898, 649, 650, 897, 651,
655, 656, 896, 895, 894, 657, 659, 661, 658, 662,
893, 667, 671, 668, 892, 674, 891, 672, 675, 677,
676, 890, 889, 888, 683, 679, 887, 691, 886, 692,
694, 695, 885, 697, 884, 883, 882, 881, 693, 696,
880, 699, 705, 879, 878, 877, 706, 709, 876, 875,
874, 873, 710, 711, 712, 716, 872, 871, 868, 717,
718, 722, 720, 723, 726, 733, 728, 858, 730, 734,
735, 744, 736, 746, 747, 857, 856, 748, 751, 752,
753, 854, 853, 754, 756, 757, 759, 760, 851, 770,
850, 771, 761, 772, 773, 776, 778, 779, 781, 782,
786, 787, 788, 790, 792, 795, 793, 848, 796, 799,
800, 809, 798, 806, 810, 846, 811, 814, 844, 817,
820, 812, 822, 824, 828, 826, 831, 832, 843, 835,
842, 841, 839, 836, 535, 397, 838, 393, 961, 872,
874, 297, 878, 103
} ;
static yyconst short int yy_def[465] =
{ 0,
459, 1, 459, 459, 459, 459, 460, 461, 462, 459,
461, 461, 461, 461, 463, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 460, 459, 461, 459,
464, 464, 459, 459, 461, 461, 461, 461, 461, 463,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
459, 464, 464, 459, 461, 461, 461, 49, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 49, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 459,
459, 459, 459, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 166, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 459, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 461, 461,
461, 461, 461, 461, 461, 461, 461, 461, 0, 459,
459, 459, 459, 459
} ;
static yyconst short int yy_nxt[1003] =
{ 0,
4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
14, 4, 15, 8, 8, 8, 16, 17, 18, 19,
20, 21, 22, 8, 23, 8, 24, 25, 26, 27,
28, 8, 29, 30, 31, 32, 33, 34, 35, 8,
36, 42, 40, 43, 43, 44, 44, 45, 45, 40,
46, 40, 40, 40, 47, 48, 48, 40, 47, 48,
48, 40, 241, 40, 191, 40, 40, 40, 40, 82,
60, 51, 61, 40, 119, 83, 88, 56, 52, 40,
53, 57, 54, 62, 49, 55, 58, 63, 64, 59,
67, 40, 65, 40, 40, 40, 69, 66, 40, 40,
68, 40, 72, 40, 40, 112, 70, 108, 73, 76,
74, 75, 71, 40, 84, 86, 85, 77, 79, 109,
133, 87, 78, 40, 40, 40, 113, 113, 97, 106,
40, 80, 43, 43, 110, 40, 115, 81, 89, 40,
40, 98, 107, 120, 99, 121, 90, 40, 162, 91,
40, 100, 92, 93, 114, 44, 44, 47, 45, 45,
40, 125, 40, 94, 95, 40, 96, 89, 40, 40,
122, 137, 116, 116, 40, 101, 126, 117, 47, 48,
48, 40, 102, 117, 103, 40, 104, 123, 40, 40,
161, 105, 118, 118, 40, 40, 118, 118, 40, 118,
118, 118, 118, 118, 118, 124, 127, 40, 40, 40,
128, 40, 40, 131, 130, 132, 134, 129, 40, 138,
40, 40, 40, 40, 40, 139, 40, 141, 135, 40,
144, 40, 151, 136, 142, 40, 40, 40, 143, 40,
152, 140, 146, 40, 40, 145, 153, 157, 147, 154,
156, 158, 40, 148, 149, 40, 150, 40, 160, 40,
159, 155, 40, 40, 40, 163, 40, 40, 40, 168,
40, 164, 175, 177, 40, 40, 40, 169, 165, 178,
40, 176, 40, 171, 166, 170, 172, 167, 179, 173,
40, 185, 174, 181, 40, 183, 180, 40, 184, 41,
186, 40, 187, 40, 182, 192, 193, 188, 197, 40,
195, 198, 196, 113, 113, 189, 201, 201, 194, 40,
190, 202, 40, 116, 116, 40, 40, 202, 117, 40,
199, 208, 203, 204, 117, 205, 205, 40, 40, 40,
206, 40, 212, 40, 207, 40, 40, 40, 40, 40,
40, 209, 40, 213, 210, 215, 211, 40, 218, 220,
40, 40, 216, 217, 40, 214, 40, 40, 40, 221,
219, 223, 225, 226, 228, 227, 40, 40, 40, 40,
40, 222, 40, 40, 224, 40, 230, 231, 40, 233,
40, 229, 40, 236, 40, 40, 234, 232, 40, 237,
40, 40, 40, 40, 40, 238, 235, 40, 40, 240,
246, 253, 242, 252, 40, 40, 239, 243, 243, 251,
40, 243, 243, 244, 243, 243, 243, 243, 243, 243,
245, 40, 40, 40, 40, 254, 40, 40, 255, 258,
247, 40, 248, 259, 257, 260, 249, 256, 250, 40,
40, 40, 40, 40, 40, 40, 40, 40, 40, 264,
261, 266, 269, 273, 262, 271, 263, 267, 265, 40,
40, 268, 40, 40, 201, 201, 270, 272, 284, 202,
276, 276, 40, 40, 274, 202, 40, 40, 203, 203,
275, 276, 276, 205, 205, 40, 205, 205, 40, 277,
40, 40, 40, 279, 280, 40, 282, 278, 281, 40,
40, 40, 40, 40, 40, 287, 40, 40, 285, 290,
40, 40, 291, 292, 286, 283, 295, 40, 40, 40,
288, 40, 40, 289, 40, 294, 296, 40, 40, 40,
293, 40, 40, 40, 40, 299, 40, 300, 40, 297,
298, 307, 301, 302, 304, 303, 40, 308, 40, 40,
40, 40, 40, 309, 40, 305, 306, 311, 310, 313,
315, 40, 317, 318, 40, 40, 40, 40, 40, 40,
319, 312, 316, 314, 320, 321, 324, 323, 40, 322,
40, 40, 326, 40, 40, 327, 40, 40, 325, 40,
40, 276, 276, 40, 40, 40, 40, 331, 328, 335,
40, 336, 337, 334, 329, 330, 40, 339, 40, 40,
40, 338, 333, 40, 332, 341, 40, 340, 40, 342,
40, 40, 40, 40, 40, 343, 40, 346, 347, 40,
40, 348, 40, 345, 350, 40, 344, 40, 349, 353,
40, 355, 356, 352, 40, 40, 354, 351, 40, 357,
40, 40, 40, 358, 359, 360, 40, 40, 40, 40,
40, 363, 40, 40, 364, 362, 366, 368, 40, 40,
369, 361, 40, 40, 371, 40, 40, 40, 40, 365,
40, 367, 370, 377, 40, 373, 374, 378, 375, 380,
376, 372, 40, 40, 40, 40, 40, 40, 40, 379,
40, 385, 383, 381, 384, 386, 40, 40, 382, 389,
40, 40, 40, 40, 388, 387, 390, 40, 40, 40,
391, 40, 392, 40, 40, 394, 393, 40, 398, 40,
395, 40, 399, 397, 40, 40, 40, 40, 400, 401,
396, 407, 402, 403, 406, 40, 409, 40, 40, 40,
408, 404, 40, 40, 40, 40, 405, 40, 40, 411,
40, 40, 40, 415, 412, 418, 417, 420, 416, 413,
410, 40, 40, 40, 40, 419, 414, 40, 424, 40,
40, 422, 40, 40, 421, 423, 427, 40, 40, 40,
425, 40, 431, 40, 40, 429, 40, 40, 430, 40,
40, 40, 435, 428, 432, 436, 426, 40, 433, 439,
40, 40, 40, 40, 434, 40, 440, 437, 40, 441,
443, 40, 442, 40, 446, 40, 438, 40, 444, 40,
445, 447, 40, 40, 449, 453, 40, 40, 448, 40,
40, 450, 40, 40, 40, 40, 457, 40, 451, 40,
452, 40, 40, 456, 40, 40, 455, 40, 40, 40,
458, 454, 37, 37, 37, 37, 39, 39, 50, 40,
50, 50, 40, 40, 40, 40, 40, 40, 40, 40,
40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
40, 200, 40, 40, 40, 40, 111, 40, 38, 459,
3, 459, 459, 459, 459, 459, 459, 459, 459, 459,
459, 459, 459, 459, 459, 459, 459, 459, 459, 459,
459, 459, 459, 459, 459, 459, 459, 459, 459, 459,
459, 459, 459, 459, 459, 459, 459, 459, 459, 459,
459, 459
} ;
static yyconst short int yy_chk[1003] =
{ 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, 9, 161, 9, 9, 10, 10, 11, 11, 11,
12, 26, 105, 12, 13, 13, 13, 13, 14, 14,
14, 14, 161, 16, 105, 18, 51, 29, 17, 26,
18, 16, 18, 20, 51, 26, 29, 17, 16, 19,
16, 17, 16, 18, 13, 16, 17, 18, 19, 17,
20, 21, 19, 22, 23, 27, 21, 19, 34, 63,
20, 35, 22, 28, 24, 464, 21, 34, 22, 24,
23, 23, 21, 25, 27, 28, 27, 24, 25, 35,
63, 28, 24, 31, 33, 36, 42, 42, 31, 33,
52, 25, 43, 43, 36, 86, 46, 25, 30, 46,
30, 31, 33, 52, 31, 52, 30, 66, 86, 30,
56, 31, 30, 30, 44, 44, 44, 45, 45, 45,
45, 56, 53, 30, 30, 57, 30, 32, 54, 32,
53, 66, 47, 47, 47, 32, 57, 47, 48, 48,
48, 48, 32, 47, 32, 84, 32, 54, 58, 55,
84, 32, 49, 49, 49, 60, 49, 49, 62, 49,
49, 49, 49, 49, 49, 55, 58, 61, 65, 64,
60, 67, 69, 62, 61, 62, 64, 60, 68, 67,
70, 71, 72, 77, 73, 68, 76, 69, 64, 74,
71, 75, 76, 65, 69, 79, 81, 82, 70, 80,
77, 68, 73, 83, 78, 72, 77, 80, 74, 78,
79, 81, 87, 75, 75, 88, 75, 89, 83, 90,
82, 78, 91, 94, 93, 87, 96, 95, 92, 91,
101, 88, 93, 95, 102, 97, 100, 91, 88, 96,
99, 94, 103, 92, 89, 91, 92, 90, 97, 92,
109, 102, 92, 99, 104, 100, 97, 107, 101, 462,
103, 106, 104, 108, 99, 106, 106, 104, 108, 110,
107, 109, 107, 113, 113, 104, 114, 114, 106, 129,
104, 114, 123, 116, 116, 116, 121, 114, 116, 120,
110, 123, 117, 117, 116, 117, 117, 117, 125, 127,
120, 128, 129, 132, 121, 131, 133, 134, 135, 141,
139, 125, 137, 131, 127, 133, 128, 138, 137, 139,
140, 142, 134, 135, 144, 132, 145, 143, 146, 140,
138, 141, 143, 144, 146, 145, 147, 148, 149, 150,
151, 140, 152, 153, 142, 154, 148, 149, 155, 151,
156, 147, 157, 154, 160, 163, 152, 150, 172, 155,
167, 169, 175, 174, 458, 156, 153, 168, 456, 160,
169, 175, 163, 174, 176, 178, 157, 166, 166, 172,
181, 166, 166, 167, 166, 166, 166, 166, 166, 166,
168, 170, 179, 180, 182, 176, 183, 184, 178, 181,
170, 185, 170, 182, 180, 183, 170, 179, 170, 186,
187, 188, 189, 191, 190, 193, 194, 192, 196, 187,
184, 189, 192, 196, 185, 194, 186, 190, 188, 195,
197, 191, 199, 216, 201, 201, 193, 195, 216, 201,
203, 203, 206, 214, 197, 201, 208, 209, 202, 202,
199, 202, 202, 204, 204, 204, 205, 205, 205, 206,
207, 213, 215, 208, 209, 217, 214, 207, 213, 218,
219, 220, 221, 223, 222, 219, 224, 225, 217, 222,
227, 228, 223, 224, 218, 215, 228, 229, 230, 231,
220, 232, 233, 221, 234, 227, 229, 238, 235, 239,
225, 241, 244, 242, 245, 232, 455, 233, 247, 230,
231, 244, 234, 235, 239, 238, 246, 245, 248, 251,
249, 250, 252, 246, 253, 241, 242, 248, 247, 249,
250, 254, 252, 253, 258, 263, 257, 255, 261, 265,
254, 248, 251, 249, 255, 257, 263, 261, 264, 258,
266, 267, 265, 268, 269, 266, 270, 271, 264, 273,
275, 276, 276, 279, 278, 281, 284, 270, 267, 278,
283, 279, 281, 275, 268, 269, 282, 283, 287, 285,
286, 282, 273, 288, 271, 285, 289, 284, 296, 286,
290, 292, 294, 295, 297, 287, 298, 290, 292, 301,
299, 294, 302, 289, 296, 303, 288, 308, 295, 299,
304, 302, 303, 298, 305, 306, 301, 297, 309, 304,
317, 318, 320, 305, 306, 308, 321, 322, 326, 329,
327, 318, 328, 330, 320, 317, 322, 327, 332, 334,
328, 309, 333, 338, 330, 336, 339, 341, 340, 321,
346, 326, 329, 339, 345, 333, 334, 340, 336, 345,
338, 332, 348, 350, 359, 351, 352, 360, 354, 341,
362, 352, 350, 346, 351, 354, 363, 367, 348, 362,
368, 373, 374, 375, 360, 359, 363, 376, 380, 381,
367, 383, 368, 382, 384, 374, 373, 385, 381, 387,
375, 389, 382, 380, 386, 390, 391, 393, 383, 384,
376, 391, 385, 386, 390, 392, 393, 394, 395, 398,
392, 387, 399, 400, 401, 404, 389, 405, 406, 395,
407, 408, 413, 401, 398, 406, 405, 408, 404, 399,
394, 410, 412, 414, 415, 407, 400, 416, 414, 417,
418, 412, 419, 420, 410, 413, 417, 421, 422, 423,
415, 424, 421, 425, 427, 419, 426, 429, 420, 433,
430, 431, 425, 418, 422, 426, 416, 434, 423, 430,
432, 435, 437, 442, 424, 438, 431, 427, 440, 432,
434, 441, 433, 443, 438, 444, 429, 446, 435, 445,
437, 440, 447, 448, 442, 446, 450, 454, 441, 457,
453, 443, 452, 451, 449, 439, 454, 436, 444, 428,
445, 411, 409, 450, 403, 402, 448, 397, 396, 388,
457, 447, 460, 460, 460, 460, 461, 461, 463, 379,
463, 463, 378, 377, 372, 371, 370, 369, 366, 365,
364, 361, 358, 357, 356, 355, 353, 349, 347, 344,
343, 342, 337, 335, 331, 325, 324, 323, 319, 316,
315, 314, 313, 312, 311, 310, 307, 300, 293, 291,
280, 277, 274, 272, 262, 260, 259, 256, 240, 237,
236, 226, 212, 211, 210, 198, 177, 173, 171, 165,
164, 162, 159, 158, 136, 130, 126, 124, 122, 119,
115, 111, 98, 85, 59, 39, 37, 8, 7, 3,
459, 459, 459, 459, 459, 459, 459, 459, 459, 459,
459, 459, 459, 459, 459, 459, 459, 459, 459, 459,
459, 459, 459, 459, 459, 459, 459, 459, 459, 459,
459, 459, 459, 459, 459, 459, 459, 459, 459, 459,
459, 459
} ;
static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr;
static char *yy_full_match;
static int yy_lp;
#define REJECT \
{ \
*yy_cp = yy_hold_char; /* undo effects of setting up yytext */ \
yy_cp = yy_full_match; /* restore poss. backed-over text */ \
++yy_lp; \
goto find_rule; \
}
#define yymore() yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
char *yytext;
#line 1 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
#define INITIAL 0
/*===-- Lexer.l - Scanner for llvm assembly files --------------*- C++ -*--===//
//
// The LLVM Compiler Infrastructure
//
// This file was developed by the LLVM research group and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file implements the flex scanner for LLVM assembly languages files.
//
//===----------------------------------------------------------------------===*/
#define YY_NEVER_INTERACTIVE 1
#line 28 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
#include "ParserInternals.h"
#include "llvm/Module.h"
#include <list>
#include "llvmAsmParser.h"
#include <cctype>
#include <cstdlib>
void set_scan_file(FILE * F){
yy_switch_to_buffer(yy_create_buffer( F, YY_BUF_SIZE ) );
}
void set_scan_string (const char * str) {
yy_scan_string (str);
}
#define RET_TOK(type, Enum, sym) \
llvmAsmlval.type = Instruction::Enum; return sym
namespace llvm {
// TODO: All of the static identifiers are figured out by the lexer,
// these should be hashed to reduce the lexer size
// atoull - Convert an ascii string of decimal digits into the unsigned long
// long representation... this does not have to do input error checking,
// because we know that the input will be matched by a suitable regex...
//
static uint64_t atoull(const char *Buffer) {
uint64_t Result = 0;
for (; *Buffer; Buffer++) {
uint64_t OldRes = Result;
Result *= 10;
Result += *Buffer-'0';
if (Result < OldRes) // Uh, oh, overflow detected!!!
ThrowException("constant bigger than 64 bits detected!");
}
return Result;
}
static uint64_t HexIntToVal(const char *Buffer) {
uint64_t Result = 0;
for (; *Buffer; ++Buffer) {
uint64_t OldRes = Result;
Result *= 16;
char C = *Buffer;
if (C >= '0' && C <= '9')
Result += C-'0';
else if (C >= 'A' && C <= 'F')
Result += C-'A'+10;
else if (C >= 'a' && C <= 'f')
Result += C-'a'+10;
if (Result < OldRes) // Uh, oh, overflow detected!!!
ThrowException("constant bigger than 64 bits detected!");
}
return Result;
}
// HexToFP - Convert the ascii string in hexidecimal format to the floating
// point representation of it.
//
static double HexToFP(const char *Buffer) {
// Behave nicely in the face of C TBAA rules... see:
// http://www.nullstone.com/htmls/category/aliastyp.htm
union {
uint64_t UI;
double FP;
} UIntToFP;
UIntToFP.UI = HexIntToVal(Buffer);
assert(sizeof(double) == sizeof(uint64_t) &&
"Data sizes incompatible on this target!");
return UIntToFP.FP; // Cast Hex constant to double
}
// UnEscapeLexed - Run through the specified buffer and change \xx codes to the
// appropriate character. If AllowNull is set to false, a \00 value will cause
// an exception to be thrown.
//
// If AllowNull is set to true, the return value of the function points to the
// last character of the string in memory.
//
char *UnEscapeLexed(char *Buffer, bool AllowNull) {
char *BOut = Buffer;
for (char *BIn = Buffer; *BIn; ) {
if (BIn[0] == '\\' && isxdigit(BIn[1]) && isxdigit(BIn[2])) {
char Tmp = BIn[3]; BIn[3] = 0; // Terminate string
*BOut = (char)strtol(BIn+1, 0, 16); // Convert to number
if (!AllowNull && !*BOut)
ThrowException("String literal cannot accept \\00 escape!");
BIn[3] = Tmp; // Restore character
BIn += 3; // Skip over handled chars
++BOut;
} else {
*BOut++ = *BIn++;
}
}
return BOut;
}
} // End llvm namespace
using namespace llvm;
#define YY_NEVER_INTERACTIVE 1
/* Comments start with a ; and go till end of line */
/* Variable(Value) identifiers start with a % sign */
/* Label identifiers end with a colon */
/* Quoted names can contain any character except " and \ */
/* [PN]Integer: match positive and negative literal integer values that
* are preceeded by a '%' character. These represent unnamed variable slots.
*/
/* E[PN]Integer: match positive and negative literal integer values */
/* FPConstant - A Floating point constant.
*/
/* HexFPConstant - Floating point constant represented in IEEE format as a
* hexadecimal number for when exponential notation is not precise enough.
*/
/* HexIntConstant - Hexadecimal constant generated by the CFE to avoid forcing
* it to deal with 64 bit numbers.
*/
#line 928 "Lexer.cpp"
/* Macros after this point can all be overridden by user definitions in
* section 1.
*/
#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int yywrap YY_PROTO(( void ));
#else
extern int yywrap YY_PROTO(( void ));
#endif
#endif
#ifndef YY_NO_UNPUT
static inline void yyunput YY_PROTO(( int c, char *buf_ptr ));
#endif
#ifndef yytext_ptr
static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int ));
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen YY_PROTO(( yyconst char * ));
#endif
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput YY_PROTO(( void ));
#else
static int input YY_PROTO(( void ));
#endif
#endif
#if YY_STACK_USED
static int yy_start_stack_ptr = 0;
static int yy_start_stack_depth = 0;
static int *yy_start_stack = 0;
#ifndef YY_NO_PUSH_STATE
static void yy_push_state YY_PROTO(( int new_state ));
#endif
#ifndef YY_NO_POP_STATE
static void yy_pop_state YY_PROTO(( void ));
#endif
#ifndef YY_NO_TOP_STATE
static int yy_top_state YY_PROTO(( void ));
#endif
#else
#define YY_NO_PUSH_STATE 1
#define YY_NO_POP_STATE 1
#define YY_NO_TOP_STATE 1
#endif
#ifdef YY_MALLOC_DECL
YY_MALLOC_DECL
#else
#if __STDC__
#ifndef __cplusplus
#include <stdlib.h>
#endif
#else
/* Just try to get by without declaring the routines. This will fail
* miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
* or sizeof(void*) != sizeof(int).
*/
#endif
#endif
/* Amount of stuff to slurp up with each read. */
#ifndef YY_READ_BUF_SIZE
#define YY_READ_BUF_SIZE 8192
#endif
/* Copy whatever the last rule matched to the standard output. */
#ifndef ECHO
/* This used to be an fputs(), but since the string might contain NUL's,
* we now use fwrite().
*/
#define ECHO (void) fwrite( yytext, yyleng, 1, yyout )
#endif
/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
* is returned in "result".
*/
#ifndef YY_INPUT
#define YY_INPUT(buf,result,max_size) \
if ( yy_current_buffer->yy_is_interactive ) \
{ \
int c = '*', n; \
for ( n = 0; n < max_size && \
(c = getc( yyin )) != EOF && c != '\n'; ++n ) \
buf[n] = (char) c; \
if ( c == '\n' ) \
buf[n++] = (char) c; \
if ( c == EOF && ferror( yyin ) ) \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
result = n; \
} \
else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
&& ferror( yyin ) ) \
YY_FATAL_ERROR( "input in flex scanner failed" );
#endif
/* No semi-colon after return; correct usage is to write "yyterminate();" -
* we don't want an extra ';' after the "return" because that will cause
* some compilers to complain about unreachable statements.
*/
#ifndef yyterminate
#define yyterminate() return YY_NULL
#endif
/* Number of entries by which start-condition stack grows. */
#ifndef YY_START_STACK_INCR
#define YY_START_STACK_INCR 25
#endif
/* Report a fatal error. */
#ifndef YY_FATAL_ERROR
#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
#endif
/* Default declaration of generated scanner - a define so the user can
* easily add parameters.
*/
#ifndef YY_DECL
#define YY_DECL int yylex YY_PROTO(( void ))
#endif
/* Code executed at the beginning of each rule, after yytext and yyleng
* have been set up.
*/
#ifndef YY_USER_ACTION
#define YY_USER_ACTION
#endif
/* Code executed at the end of each rule. */
#ifndef YY_BREAK
#define YY_BREAK break;
#endif
#define YY_RULE_SETUP \
YY_USER_ACTION
YY_DECL
{
register yy_state_type yy_current_state;
register char *yy_cp, *yy_bp;
register int yy_act;
#line 179 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
#line 1082 "Lexer.cpp"
if ( yy_init )
{
yy_init = 0;
#ifdef YY_USER_INIT
YY_USER_INIT;
#endif
if ( ! yy_start )
yy_start = 1; /* first start state */
if ( ! yyin )
yyin = stdin;
if ( ! yyout )
yyout = stdout;
if ( ! yy_current_buffer )
yy_current_buffer =
yy_create_buffer( yyin, YY_BUF_SIZE );
yy_load_buffer_state();
}
while ( 1 ) /* loops until end-of-file is reached */
{
yy_cp = yy_c_buf_p;
/* Support of yytext. */
*yy_cp = yy_hold_char;
/* yy_bp points to the position in yy_ch_buf of the start of
* the current run.
*/
yy_bp = yy_cp;
yy_current_state = yy_start;
yy_state_ptr = yy_state_buf;
*yy_state_ptr++ = yy_current_state;
yy_match:
do
{
register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 460 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
*yy_state_ptr++ = yy_current_state;
++yy_cp;
}
while ( yy_current_state != 459 );
yy_find_action:
yy_current_state = *--yy_state_ptr;
yy_lp = yy_accept[yy_current_state];
find_rule: /* we branch to this label when backing up */
for ( ; ; ) /* until we find what rule we matched */
{
if ( yy_lp && yy_lp < yy_accept[yy_current_state + 1] )
{
yy_act = yy_acclist[yy_lp];
{
yy_full_match = yy_cp;
break;
}
}
--yy_cp;
yy_current_state = *--yy_state_ptr;
yy_lp = yy_accept[yy_current_state];
}
YY_DO_BEFORE_ACTION;
if ( yy_act != YY_END_OF_BUFFER )
{
int yyl;
for ( yyl = 0; yyl < yyleng; ++yyl )
if ( yytext[yyl] == '\n' )
++yylineno;
}
do_action: /* This label is used only to access EOF actions. */
switch ( yy_act )
{ /* beginning of action switch */
case 1:
YY_RULE_SETUP
#line 181 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ /* Ignore comments for now */ }
YY_BREAK
case 2:
YY_RULE_SETUP
#line 183 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return BEGINTOK; }
YY_BREAK
case 3:
YY_RULE_SETUP
#line 184 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return ENDTOK; }
YY_BREAK
case 4:
YY_RULE_SETUP
#line 185 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return TRUETOK; }
YY_BREAK
case 5:
YY_RULE_SETUP
#line 186 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return FALSETOK; }
YY_BREAK
case 6:
YY_RULE_SETUP
#line 187 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return DECLARE; }
YY_BREAK
case 7:
YY_RULE_SETUP
#line 188 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return GLOBAL; }
YY_BREAK
case 8:
YY_RULE_SETUP
#line 189 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return CONSTANT; }
YY_BREAK
case 9:
YY_RULE_SETUP
#line 190 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return INTERNAL; }
YY_BREAK
case 10:
YY_RULE_SETUP
#line 191 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return LINKONCE; }
YY_BREAK
case 11:
YY_RULE_SETUP
#line 192 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return WEAK; }
YY_BREAK
case 12:
YY_RULE_SETUP
#line 193 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return APPENDING; }
YY_BREAK
case 13:
YY_RULE_SETUP
#line 194 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return EXTERNAL; } /* Deprecated, turn into external */
YY_BREAK
case 14:
YY_RULE_SETUP
#line 195 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return EXTERNAL; }
YY_BREAK
case 15:
YY_RULE_SETUP
#line 196 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return IMPLEMENTATION; }
YY_BREAK
case 16:
YY_RULE_SETUP
#line 197 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return ZEROINITIALIZER; }
YY_BREAK
case 17:
YY_RULE_SETUP
#line 198 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return DOTDOTDOT; }
YY_BREAK
case 18:
YY_RULE_SETUP
#line 199 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return UNDEF; }
YY_BREAK
case 19:
YY_RULE_SETUP
#line 200 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return NULL_TOK; }
YY_BREAK
case 20:
YY_RULE_SETUP
#line 201 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return TO; }
YY_BREAK
case 21:
YY_RULE_SETUP
#line 202 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(TermOpVal, Unwind, UNWIND); }
YY_BREAK
case 22:
YY_RULE_SETUP
#line 203 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return NOT; } /* Deprecated, turned into XOR */
YY_BREAK
case 23:
YY_RULE_SETUP
#line 204 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return TAIL; }
YY_BREAK
case 24:
YY_RULE_SETUP
#line 205 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return TARGET; }
YY_BREAK
case 25:
YY_RULE_SETUP
#line 206 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return TRIPLE; }
YY_BREAK
case 26:
YY_RULE_SETUP
#line 207 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return DEPLIBS; }
YY_BREAK
case 27:
YY_RULE_SETUP
#line 208 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return ENDIAN; }
YY_BREAK
case 28:
YY_RULE_SETUP
#line 209 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return POINTERSIZE; }
YY_BREAK
case 29:
YY_RULE_SETUP
#line 210 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return LITTLE; }
YY_BREAK
case 30:
YY_RULE_SETUP
#line 211 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return BIG; }
YY_BREAK
case 31:
YY_RULE_SETUP
#line 212 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return VOLATILE; }
YY_BREAK
case 32:
YY_RULE_SETUP
#line 213 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return ALIGN; }
YY_BREAK
case 33:
YY_RULE_SETUP
#line 214 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return SECTION; }
YY_BREAK
case 34:
YY_RULE_SETUP
#line 215 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return MODULE; }
YY_BREAK
case 35:
YY_RULE_SETUP
#line 216 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return ASM_TOK; }
YY_BREAK
case 36:
YY_RULE_SETUP
#line 217 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return SIDEEFFECT; }
YY_BREAK
case 37:
YY_RULE_SETUP
#line 219 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return CC_TOK; }
YY_BREAK
case 38:
YY_RULE_SETUP
#line 220 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return CCC_TOK; }
YY_BREAK
case 39:
YY_RULE_SETUP
#line 221 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return CSRETCC_TOK; }
YY_BREAK
case 40:
YY_RULE_SETUP
#line 222 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return FASTCC_TOK; }
YY_BREAK
case 41:
YY_RULE_SETUP
#line 223 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return COLDCC_TOK; }
YY_BREAK
case 42:
YY_RULE_SETUP
#line 225 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.PrimType = Type::VoidTy ; return VOID; }
YY_BREAK
case 43:
YY_RULE_SETUP
#line 226 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.PrimType = Type::BoolTy ; return BOOL; }
YY_BREAK
case 44:
YY_RULE_SETUP
#line 227 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.PrimType = Type::SByteTy ; return SBYTE; }
YY_BREAK
case 45:
YY_RULE_SETUP
#line 228 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.PrimType = Type::UByteTy ; return UBYTE; }
YY_BREAK
case 46:
YY_RULE_SETUP
#line 229 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.PrimType = Type::ShortTy ; return SHORT; }
YY_BREAK
case 47:
YY_RULE_SETUP
#line 230 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.PrimType = Type::UShortTy; return USHORT; }
YY_BREAK
case 48:
YY_RULE_SETUP
#line 231 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.PrimType = Type::IntTy ; return INT; }
YY_BREAK
case 49:
YY_RULE_SETUP
#line 232 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.PrimType = Type::UIntTy ; return UINT; }
YY_BREAK
case 50:
YY_RULE_SETUP
#line 233 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.PrimType = Type::LongTy ; return LONG; }
YY_BREAK
case 51:
YY_RULE_SETUP
#line 234 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.PrimType = Type::ULongTy ; return ULONG; }
YY_BREAK
case 52:
YY_RULE_SETUP
#line 235 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.PrimType = Type::FloatTy ; return FLOAT; }
YY_BREAK
case 53:
YY_RULE_SETUP
#line 236 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.PrimType = Type::DoubleTy; return DOUBLE; }
YY_BREAK
case 54:
YY_RULE_SETUP
#line 237 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.PrimType = Type::LabelTy ; return LABEL; }
YY_BREAK
case 55:
YY_RULE_SETUP
#line 238 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return TYPE; }
YY_BREAK
case 56:
YY_RULE_SETUP
#line 239 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return OPAQUE; }
YY_BREAK
case 57:
YY_RULE_SETUP
#line 241 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, Add, ADD); }
YY_BREAK
case 58:
YY_RULE_SETUP
#line 242 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, Sub, SUB); }
YY_BREAK
case 59:
YY_RULE_SETUP
#line 243 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, Mul, MUL); }
YY_BREAK
case 60:
YY_RULE_SETUP
#line 244 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, Div, DIV); }
YY_BREAK
case 61:
YY_RULE_SETUP
#line 245 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, Rem, REM); }
YY_BREAK
case 62:
YY_RULE_SETUP
#line 246 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, And, AND); }
YY_BREAK
case 63:
YY_RULE_SETUP
#line 247 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, Or , OR ); }
YY_BREAK
case 64:
YY_RULE_SETUP
#line 248 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, Xor, XOR); }
YY_BREAK
case 65:
YY_RULE_SETUP
#line 249 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, SetNE, SETNE); }
YY_BREAK
case 66:
YY_RULE_SETUP
#line 250 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, SetEQ, SETEQ); }
YY_BREAK
case 67:
YY_RULE_SETUP
#line 251 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, SetLT, SETLT); }
YY_BREAK
case 68:
YY_RULE_SETUP
#line 252 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, SetGT, SETGT); }
YY_BREAK
case 69:
YY_RULE_SETUP
#line 253 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, SetLE, SETLE); }
YY_BREAK
case 70:
YY_RULE_SETUP
#line 254 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, SetGE, SETGE); }
YY_BREAK
case 71:
YY_RULE_SETUP
#line 256 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, PHI, PHI_TOK); }
YY_BREAK
case 72:
YY_RULE_SETUP
#line 257 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, Call, CALL); }
YY_BREAK
case 73:
YY_RULE_SETUP
#line 258 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, Cast, CAST); }
YY_BREAK
case 74:
YY_RULE_SETUP
#line 259 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, Select, SELECT); }
YY_BREAK
case 75:
YY_RULE_SETUP
#line 260 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, Shl, SHL); }
YY_BREAK
case 76:
YY_RULE_SETUP
#line 261 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, Shr, SHR); }
YY_BREAK
case 77:
YY_RULE_SETUP
#line 262 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return VANEXT_old; }
YY_BREAK
case 78:
YY_RULE_SETUP
#line 263 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return VAARG_old; }
YY_BREAK
case 79:
YY_RULE_SETUP
#line 264 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, VAArg , VAARG); }
YY_BREAK
case 80:
YY_RULE_SETUP
#line 265 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(TermOpVal, Ret, RET); }
YY_BREAK
case 81:
YY_RULE_SETUP
#line 266 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(TermOpVal, Br, BR); }
YY_BREAK
case 82:
YY_RULE_SETUP
#line 267 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(TermOpVal, Switch, SWITCH); }
YY_BREAK
case 83:
YY_RULE_SETUP
#line 268 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(TermOpVal, Invoke, INVOKE); }
YY_BREAK
case 84:
YY_RULE_SETUP
#line 269 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(TermOpVal, Unwind, UNWIND); }
YY_BREAK
case 85:
YY_RULE_SETUP
#line 270 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(TermOpVal, Unreachable, UNREACHABLE); }
YY_BREAK
case 86:
YY_RULE_SETUP
#line 272 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(MemOpVal, Malloc, MALLOC); }
YY_BREAK
case 87:
YY_RULE_SETUP
#line 273 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(MemOpVal, Alloca, ALLOCA); }
YY_BREAK
case 88:
YY_RULE_SETUP
#line 274 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(MemOpVal, Free, FREE); }
YY_BREAK
case 89:
YY_RULE_SETUP
#line 275 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(MemOpVal, Load, LOAD); }
YY_BREAK
case 90:
YY_RULE_SETUP
#line 276 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(MemOpVal, Store, STORE); }
YY_BREAK
case 91:
YY_RULE_SETUP
#line 277 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(MemOpVal, GetElementPtr, GETELEMENTPTR); }
YY_BREAK
case 92:
YY_RULE_SETUP
#line 279 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, ExtractElement, EXTRACTELEMENT); }
YY_BREAK
case 93:
YY_RULE_SETUP
#line 280 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, InsertElement, INSERTELEMENT); }
YY_BREAK
case 94:
YY_RULE_SETUP
#line 281 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, ShuffleVector, SHUFFLEVECTOR); }
YY_BREAK
case 95:
YY_RULE_SETUP
#line 284 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{
UnEscapeLexed(yytext+1);
llvmAsmlval.StrVal = strdup(yytext+1); // Skip %
return VAR_ID;
}
YY_BREAK
case 96:
YY_RULE_SETUP
#line 289 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{
yytext[strlen(yytext)-1] = 0; // nuke colon
UnEscapeLexed(yytext);
llvmAsmlval.StrVal = strdup(yytext);
return LABELSTR;
}
YY_BREAK
case 97:
YY_RULE_SETUP
#line 295 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{
yytext[strlen(yytext)-2] = 0; // nuke colon, end quote
UnEscapeLexed(yytext+1);
llvmAsmlval.StrVal = strdup(yytext+1);
return LABELSTR;
}
YY_BREAK
case 98:
YY_RULE_SETUP
#line 302 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ // Note that we cannot unescape a string constant here! The
// string constant might contain a \00 which would not be
// understood by the string stuff. It is valid to make a
// [sbyte] c"Hello World\00" constant, for example.
//
yytext[strlen(yytext)-1] = 0; // nuke end quote
llvmAsmlval.StrVal = strdup(yytext+1); // Nuke start quote
return STRINGCONSTANT;
}
YY_BREAK
case 99:
YY_RULE_SETUP
#line 313 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.UInt64Val = atoull(yytext); return EUINT64VAL; }
YY_BREAK
case 100:
YY_RULE_SETUP
#line 314 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{
uint64_t Val = atoull(yytext+1);
// +1: we have bigger negative range
if (Val > (uint64_t)INT64_MAX+1)
ThrowException("Constant too large for signed 64 bits!");
llvmAsmlval.SInt64Val = -Val;
return ESINT64VAL;
}
YY_BREAK
case 101:
YY_RULE_SETUP
#line 322 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{
llvmAsmlval.UInt64Val = HexIntToVal(yytext+3);
return yytext[0] == 's' ? ESINT64VAL : EUINT64VAL;
}
YY_BREAK
case 102:
YY_RULE_SETUP
#line 327 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{
uint64_t Val = atoull(yytext+1);
if ((unsigned)Val != Val)
ThrowException("Invalid value number (too large)!");
llvmAsmlval.UIntVal = unsigned(Val);
return UINTVAL;
}
YY_BREAK
case 103:
YY_RULE_SETUP
#line 334 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{
uint64_t Val = atoull(yytext+2);
// +1: we have bigger negative range
if (Val > (uint64_t)INT32_MAX+1)
ThrowException("Constant too large for signed 32 bits!");
llvmAsmlval.SIntVal = (int)-Val;
return SINTVAL;
}
YY_BREAK
case 104:
YY_RULE_SETUP
#line 343 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.FPVal = atof(yytext); return FPVAL; }
YY_BREAK
case 105:
YY_RULE_SETUP
#line 344 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.FPVal = HexToFP(yytext); return FPVAL; }
YY_BREAK
case YY_STATE_EOF(INITIAL):
#line 346 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{
/* Make sure to free the internal buffers for flex when we are
* done reading our input!
*/
yy_delete_buffer(YY_CURRENT_BUFFER);
return EOF;
}
YY_BREAK
case 106:
YY_RULE_SETUP
#line 354 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ /* Ignore whitespace */ }
YY_BREAK
case 107:
YY_RULE_SETUP
#line 355 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
{ return yytext[0]; }
YY_BREAK
case 108:
YY_RULE_SETUP
#line 357 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"
YY_FATAL_ERROR( "flex scanner jammed" );
YY_BREAK
#line 1768 "Lexer.cpp"
case YY_END_OF_BUFFER:
{
/* Amount of text matched not including the EOB char. */
int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;
/* Undo the effects of YY_DO_BEFORE_ACTION. */
*yy_cp = yy_hold_char;
YY_RESTORE_YY_MORE_OFFSET
if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW )
{
/* We're scanning a new file or input source. It's
* possible that this happened because the user
* just pointed yyin at a new source and called
* yylex(). If so, then we have to assure
* consistency between yy_current_buffer and our
* globals. Here is the right place to do so, because
* this is the first action (other than possibly a
* back-up) that will match for the new input source.
*/
yy_n_chars = yy_current_buffer->yy_n_chars;
yy_current_buffer->yy_input_file = yyin;
yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL;
}
/* Note that here we test for yy_c_buf_p "<=" to the position
* of the first EOB in the buffer, since yy_c_buf_p will
* already have been incremented past the NUL character
* (since all states make transitions on EOB to the
* end-of-buffer state). Contrast this with the test
* in input().
*/
if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] )
{ /* This was really a NUL. */
yy_state_type yy_next_state;
yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state();
/* Okay, we're now positioned to make the NUL
* transition. We couldn't have
* yy_get_previous_state() go ahead and do it
* for us because it doesn't know how to deal
* with the possibility of jamming (and we don't
* want to build jamming into it because then it
* will run more slowly).
*/
yy_next_state = yy_try_NUL_trans( yy_current_state );
yy_bp = yytext_ptr + YY_MORE_ADJ;
if ( yy_next_state )
{
/* Consume the NUL. */
yy_cp = ++yy_c_buf_p;
yy_current_state = yy_next_state;
goto yy_match;
}
else
{
yy_cp = yy_c_buf_p;
goto yy_find_action;
}
}
else switch ( yy_get_next_buffer() )
{
case EOB_ACT_END_OF_FILE:
{
yy_did_buffer_switch_on_eof = 0;
if ( yywrap() )
{
/* Note: because we've taken care in
* yy_get_next_buffer() to have set up
* yytext, we can now set up
* yy_c_buf_p so that if some total
* hoser (like flex itself) wants to
* call the scanner after we return the
* YY_NULL, it'll still work - another
* YY_NULL will get returned.
*/
yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;
yy_act = YY_STATE_EOF(YY_START);
goto do_action;
}
else
{
if ( ! yy_did_buffer_switch_on_eof )
YY_NEW_FILE;
}
break;
}
case EOB_ACT_CONTINUE_SCAN:
yy_c_buf_p =
yytext_ptr + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state();
yy_cp = yy_c_buf_p;
yy_bp = yytext_ptr + YY_MORE_ADJ;
goto yy_match;
case EOB_ACT_LAST_MATCH:
yy_c_buf_p =
&yy_current_buffer->yy_ch_buf[yy_n_chars];
yy_current_state = yy_get_previous_state();
yy_cp = yy_c_buf_p;
yy_bp = yytext_ptr + YY_MORE_ADJ;
goto yy_find_action;
}
break;
}
default:
YY_FATAL_ERROR(
"fatal flex scanner internal error--no action found" );
} /* end of action switch */
} /* end of scanning one token */
} /* end of yylex */
/* yy_get_next_buffer - try to read in a new buffer
*
* Returns a code representing an action:
* EOB_ACT_LAST_MATCH -
* EOB_ACT_CONTINUE_SCAN - continue scanning from current position
* EOB_ACT_END_OF_FILE - end of file
*/
static int yy_get_next_buffer()
{
register char *dest = yy_current_buffer->yy_ch_buf;
register char *source = yytext_ptr;
register int number_to_move, i;
int ret_val;
if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] )
YY_FATAL_ERROR(
"fatal flex scanner internal error--end of buffer missed" );
if ( yy_current_buffer->yy_fill_buffer == 0 )
{ /* Don't try to fill the buffer, so this is an EOF. */
if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 )
{
/* We matched a single character, the EOB, so
* treat this as a final EOF.
*/
return EOB_ACT_END_OF_FILE;
}
else
{
/* We matched some text prior to the EOB, first
* process it.
*/
return EOB_ACT_LAST_MATCH;
}
}
/* Try to read more data. */
/* First move last chars to start of buffer. */
number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1;
for ( i = 0; i < number_to_move; ++i )
*(dest++) = *(source++);
if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING )
/* don't do the read, it's not guaranteed to return an EOF,
* just force an EOF
*/
yy_current_buffer->yy_n_chars = yy_n_chars = 0;
else
{
int num_to_read =
yy_current_buffer->yy_buf_size - number_to_move - 1;
while ( num_to_read <= 0 )
{ /* Not enough room in the buffer - grow it. */
#ifdef YY_USES_REJECT
YY_FATAL_ERROR(
"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
#else
/* just a shorter name for the current buffer */
YY_BUFFER_STATE b = yy_current_buffer;
int yy_c_buf_p_offset =
(int) (yy_c_buf_p - b->yy_ch_buf);
if ( b->yy_is_our_buffer )
{
int new_size = b->yy_buf_size * 2;
if ( new_size <= 0 )
b->yy_buf_size += b->yy_buf_size / 8;
else
b->yy_buf_size *= 2;
b->yy_ch_buf = (char *)
/* Include room in for 2 EOB chars. */
yy_flex_realloc( (void *) b->yy_ch_buf,
b->yy_buf_size + 2 );
}
else
/* Can't grow it, we don't own it. */
b->yy_ch_buf = 0;
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR(
"fatal error - scanner input buffer overflow" );
yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
num_to_read = yy_current_buffer->yy_buf_size -
number_to_move - 1;
#endif
}
if ( num_to_read > YY_READ_BUF_SIZE )
num_to_read = YY_READ_BUF_SIZE;
/* Read in more data. */
YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
yy_n_chars, num_to_read );
yy_current_buffer->yy_n_chars = yy_n_chars;
}
if ( yy_n_chars == 0 )
{
if ( number_to_move == YY_MORE_ADJ )
{
ret_val = EOB_ACT_END_OF_FILE;
yyrestart( yyin );
}
else
{
ret_val = EOB_ACT_LAST_MATCH;
yy_current_buffer->yy_buffer_status =
YY_BUFFER_EOF_PENDING;
}
}
else
ret_val = EOB_ACT_CONTINUE_SCAN;
yy_n_chars += number_to_move;
yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
yytext_ptr = &yy_current_buffer->yy_ch_buf[0];
return ret_val;
}
/* yy_get_previous_state - get the state just before the EOB char was reached */
static yy_state_type yy_get_previous_state()
{
register yy_state_type yy_current_state;
register char *yy_cp;
yy_current_state = yy_start;
yy_state_ptr = yy_state_buf;
*yy_state_ptr++ = yy_current_state;
for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp )
{
register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 460 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
*yy_state_ptr++ = yy_current_state;
}
return yy_current_state;
}
/* yy_try_NUL_trans - try to make a transition on the NUL character
*
* synopsis
* next_state = yy_try_NUL_trans( current_state );
*/
#ifdef YY_USE_PROTOS
static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
#else
static yy_state_type yy_try_NUL_trans( yy_current_state )
yy_state_type yy_current_state;
#endif
{
register int yy_is_jam;
register YY_CHAR yy_c = 1;
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 460 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
yy_is_jam = (yy_current_state == 459);
if ( ! yy_is_jam )
*yy_state_ptr++ = yy_current_state;
return yy_is_jam ? 0 : yy_current_state;
}
#ifndef YY_NO_UNPUT
#ifdef YY_USE_PROTOS
static inline void yyunput( int c, register char *yy_bp )
#else
static inline void yyunput( c, yy_bp )
int c;
register char *yy_bp;
#endif
{
register char *yy_cp = yy_c_buf_p;
/* undo effects of setting up yytext */
*yy_cp = yy_hold_char;
if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
{ /* need to shift things up to make room */
/* +2 for EOB chars. */
register int number_to_move = yy_n_chars + 2;
register char *dest = &yy_current_buffer->yy_ch_buf[
yy_current_buffer->yy_buf_size + 2];
register char *source =
&yy_current_buffer->yy_ch_buf[number_to_move];
while ( source > yy_current_buffer->yy_ch_buf )
*--dest = *--source;
yy_cp += (int) (dest - source);
yy_bp += (int) (dest - source);
yy_current_buffer->yy_n_chars =
yy_n_chars = yy_current_buffer->yy_buf_size;
if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
YY_FATAL_ERROR( "flex scanner push-back overflow" );
}
*--yy_cp = (char) c;
if ( c == '\n' )
--yylineno;
yytext_ptr = yy_bp;
yy_hold_char = *yy_cp;
yy_c_buf_p = yy_cp;
}
#endif /* ifndef YY_NO_UNPUT */
#ifdef __cplusplus
static int yyinput()
#else
static int input()
#endif
{
int c;
*yy_c_buf_p = yy_hold_char;
if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
{
/* yy_c_buf_p now points to the character we want to return.
* If this occurs *before* the EOB characters, then it's a
* valid NUL; if not, then we've hit the end of the buffer.
*/
if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] )
/* This was really a NUL. */
*yy_c_buf_p = '\0';
else
{ /* need more input */
int offset = yy_c_buf_p - yytext_ptr;
++yy_c_buf_p;
switch ( yy_get_next_buffer() )
{
case EOB_ACT_LAST_MATCH:
/* This happens because yy_g_n_b()
* sees that we've accumulated a
* token and flags that we need to
* try matching the token before
* proceeding. But for input(),
* there's no matching to consider.
* So convert the EOB_ACT_LAST_MATCH
* to EOB_ACT_END_OF_FILE.
*/
/* Reset buffer status. */
yyrestart( yyin );
/* fall through */
case EOB_ACT_END_OF_FILE:
{
if ( yywrap() )
return 0;
if ( ! yy_did_buffer_switch_on_eof )
YY_NEW_FILE;
#ifdef __cplusplus
return yyinput();
#else
return input();
#endif
}
case EOB_ACT_CONTINUE_SCAN:
yy_c_buf_p = yytext_ptr + offset;
break;
}
}
}
c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */
*yy_c_buf_p = '\0'; /* preserve yytext */
yy_hold_char = *++yy_c_buf_p;
if ( c == '\n' )
++yylineno;
return c;
}
#ifdef YY_USE_PROTOS
void yyrestart( FILE *input_file )
#else
void yyrestart( input_file )
FILE *input_file;
#endif
{
if ( ! yy_current_buffer )
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );
yy_init_buffer( yy_current_buffer, input_file );
yy_load_buffer_state();
}
#ifdef YY_USE_PROTOS
void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
#else
void yy_switch_to_buffer( new_buffer )
YY_BUFFER_STATE new_buffer;
#endif
{
if ( yy_current_buffer == new_buffer )
return;
if ( yy_current_buffer )
{
/* Flush out information for old buffer. */
*yy_c_buf_p = yy_hold_char;
yy_current_buffer->yy_buf_pos = yy_c_buf_p;
yy_current_buffer->yy_n_chars = yy_n_chars;
}
yy_current_buffer = new_buffer;
yy_load_buffer_state();
/* We don't actually know whether we did this switch during
* EOF (yywrap()) processing, but the only time this flag
* is looked at is after yywrap() is called, so it's safe
* to go ahead and always set it.
*/
yy_did_buffer_switch_on_eof = 1;
}
#ifdef YY_USE_PROTOS
void yy_load_buffer_state( void )
#else
void yy_load_buffer_state()
#endif
{
yy_n_chars = yy_current_buffer->yy_n_chars;
yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
yyin = yy_current_buffer->yy_input_file;
yy_hold_char = *yy_c_buf_p;
}
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
#else
YY_BUFFER_STATE yy_create_buffer( file, size )
FILE *file;
int size;
#endif
{
YY_BUFFER_STATE b;
b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
b->yy_buf_size = size;
/* yy_ch_buf has to be 2 characters longer than the size given because
* we need to put in 2 end-of-buffer characters.
*/
b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 );
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
b->yy_is_our_buffer = 1;
yy_init_buffer( b, file );
return b;
}
#ifdef YY_USE_PROTOS
void yy_delete_buffer( YY_BUFFER_STATE b )
#else
void yy_delete_buffer( b )
YY_BUFFER_STATE b;
#endif
{
if ( ! b )
return;
if ( b == yy_current_buffer )
yy_current_buffer = (YY_BUFFER_STATE) 0;
if ( b->yy_is_our_buffer )
yy_flex_free( (void *) b->yy_ch_buf );
yy_flex_free( (void *) b );
}
#ifndef YY_ALWAYS_INTERACTIVE
#ifndef YY_NEVER_INTERACTIVE
extern int isatty YY_PROTO(( int ));
#endif
#endif
#ifdef YY_USE_PROTOS
void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
#else
void yy_init_buffer( b, file )
YY_BUFFER_STATE b;
FILE *file;
#endif
{
yy_flush_buffer( b );
b->yy_input_file = file;
b->yy_fill_buffer = 1;
#if YY_ALWAYS_INTERACTIVE
b->yy_is_interactive = 1;
#else
#if YY_NEVER_INTERACTIVE
b->yy_is_interactive = 0;
#else
b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
#endif
#endif
}
#ifdef YY_USE_PROTOS
void yy_flush_buffer( YY_BUFFER_STATE b )
#else
void yy_flush_buffer( b )
YY_BUFFER_STATE b;
#endif
{
if ( ! b )
return;
b->yy_n_chars = 0;
/* We always need two end-of-buffer characters. The first causes
* a transition to the end-of-buffer state. The second causes
* a jam in that state.
*/
b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
b->yy_buf_pos = &b->yy_ch_buf[0];
b->yy_at_bol = 1;
b->yy_buffer_status = YY_BUFFER_NEW;
if ( b == yy_current_buffer )
yy_load_buffer_state();
}
#ifndef YY_NO_SCAN_BUFFER
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
#else
YY_BUFFER_STATE yy_scan_buffer( base, size )
char *base;
yy_size_t size;
#endif
{
YY_BUFFER_STATE b;
if ( size < 2 ||
base[size-2] != YY_END_OF_BUFFER_CHAR ||
base[size-1] != YY_END_OF_BUFFER_CHAR )
/* They forgot to leave room for the EOB's. */
return 0;
b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
b->yy_buf_pos = b->yy_ch_buf = base;
b->yy_is_our_buffer = 0;
b->yy_input_file = 0;
b->yy_n_chars = b->yy_buf_size;
b->yy_is_interactive = 0;
b->yy_at_bol = 1;
b->yy_fill_buffer = 0;
b->yy_buffer_status = YY_BUFFER_NEW;
yy_switch_to_buffer( b );
return b;
}
#endif
#ifndef YY_NO_SCAN_STRING
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str )
#else
YY_BUFFER_STATE yy_scan_string( yy_str )
yyconst char *yy_str;
#endif
{
int len;
for ( len = 0; yy_str[len]; ++len )
;
return yy_scan_bytes( yy_str, len );
}
#endif
#ifndef YY_NO_SCAN_BYTES
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
#else
YY_BUFFER_STATE yy_scan_bytes( bytes, len )
yyconst char *bytes;
int len;
#endif
{
YY_BUFFER_STATE b;
char *buf;
yy_size_t n;
int i;
/* Get memory for full buffer, including space for trailing EOB's. */
n = len + 2;
buf = (char *) yy_flex_alloc( n );
if ( ! buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
for ( i = 0; i < len; ++i )
buf[i] = bytes[i];
buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;
b = yy_scan_buffer( buf, n );
if ( ! b )
YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
/* It's okay to grow etc. this buffer, and we should throw it
* away when we're done.
*/
b->yy_is_our_buffer = 1;
return b;
}
#endif
#ifndef YY_NO_PUSH_STATE
#ifdef YY_USE_PROTOS
static void yy_push_state( int new_state )
#else
static void yy_push_state( new_state )
int new_state;
#endif
{
if ( yy_start_stack_ptr >= yy_start_stack_depth )
{
yy_size_t new_size;
yy_start_stack_depth += YY_START_STACK_INCR;
new_size = yy_start_stack_depth * sizeof( int );
if ( ! yy_start_stack )
yy_start_stack = (int *) yy_flex_alloc( new_size );
else
yy_start_stack = (int *) yy_flex_realloc(
(void *) yy_start_stack, new_size );
if ( ! yy_start_stack )
YY_FATAL_ERROR(
"out of memory expanding start-condition stack" );
}
yy_start_stack[yy_start_stack_ptr++] = YY_START;
BEGIN(new_state);
}
#endif
#ifndef YY_NO_POP_STATE
static void yy_pop_state()
{
if ( --yy_start_stack_ptr < 0 )
YY_FATAL_ERROR( "start-condition stack underflow" );
BEGIN(yy_start_stack[yy_start_stack_ptr]);
}
#endif
#ifndef YY_NO_TOP_STATE
static int yy_top_state()
{
return yy_start_stack[yy_start_stack_ptr - 1];
}
#endif
#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif
#ifdef YY_USE_PROTOS
static void yy_fatal_error( yyconst char msg[] )
#else
static void yy_fatal_error( msg )
char msg[];
#endif
{
(void) fprintf( stderr, "%s\n", msg );
exit( YY_EXIT_FAILURE );
}
/* Redefine yyless() so it works in section 3 code. */
#undef yyless
#define yyless(n) \
do \
{ \
/* Undo effects of setting up yytext. */ \
yytext[yyleng] = yy_hold_char; \
yy_c_buf_p = yytext + n; \
yy_hold_char = *yy_c_buf_p; \
*yy_c_buf_p = '\0'; \
yyleng = n; \
} \
while ( 0 )
/* Internal utility routines. */
#ifndef yytext_ptr
#ifdef YY_USE_PROTOS
static void yy_flex_strncpy( char *s1, yyconst char *s2, int n )
#else
static void yy_flex_strncpy( s1, s2, n )
char *s1;
yyconst char *s2;
int n;
#endif
{
register int i;
for ( i = 0; i < n; ++i )
s1[i] = s2[i];
}
#endif
#ifdef YY_NEED_STRLEN
#ifdef YY_USE_PROTOS
static int yy_flex_strlen( yyconst char *s )
#else
static int yy_flex_strlen( s )
yyconst char *s;
#endif
{
register int n;
for ( n = 0; s[n]; ++n )
;
return n;
}
#endif
#ifdef YY_USE_PROTOS
static void *yy_flex_alloc( yy_size_t size )
#else
static void *yy_flex_alloc( size )
yy_size_t size;
#endif
{
return (void *) malloc( size );
}
#ifdef YY_USE_PROTOS
static inline void *yy_flex_realloc( void *ptr, yy_size_t size )
#else
static inline void *yy_flex_realloc( ptr, size )
void *ptr;
yy_size_t size;
#endif
{
/* The cast to (char *) in the following accommodates both
* implementations that use char* generic pointers, and those
* that use void* generic pointers. It works with the latter
* because both ANSI C and C++ allow castless assignment from
* any pointer type to void*, and deal with argument conversions
* as though doing an assignment.
*/
return (void *) realloc( (char *) ptr, size );
}
#ifdef YY_USE_PROTOS
static void yy_flex_free( void *ptr )
#else
static void yy_flex_free( ptr )
void *ptr;
#endif
{
free( ptr );
}
#if YY_MAIN
int main()
{
yylex();
return 0;
}
#endif
#line 357 "/Volumes/Projects/cvs/llvm/lib/AsmParser/Lexer.l"