6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-11-03 14:08:57 +00:00
Code Issues Projects Releases Wiki Activity
ebff55ce38
llvm-6502/lib/AsmParser/Lexer.cpp.cvs
Lauro Ramos Venancio c763552299 Implement the "thread_local" keyword. 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@35950 91177308-0d34-0410-b5e6-96231b3b80d8
2007-04-12 18:32:50 +00:00

3106 lines
95 KiB
Plaintext
Raw Blame History

#line 2 "Lexer.cpp"
#line 4 "Lexer.cpp"
#define YY_INT_ALIGNED short int
/* A lexical scanner generated by flex */
#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 5
#define YY_FLEX_SUBMINOR_VERSION 33
#if YY_FLEX_SUBMINOR_VERSION > 0
#define FLEX_BETA
#endif
/* First, we deal with platform-specific or compiler-specific issues. */
/* begin standard C headers. */
#include <stdio.h>
#include <string.h>
#include <errno.h>
#include <stdlib.h>
/* end standard C headers. */
/* flex integer type definitions */
#ifndef FLEXINT_H
#define FLEXINT_H
/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
#if __STDC_VERSION__ >= 199901L
/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
* if you want the limit (max/min) macros for int types.
*/
#ifndef __STDC_LIMIT_MACROS
#define __STDC_LIMIT_MACROS 1
#endif
#include <inttypes.h>
typedef int8_t flex_int8_t;
typedef uint8_t flex_uint8_t;
typedef int16_t flex_int16_t;
typedef uint16_t flex_uint16_t;
typedef int32_t flex_int32_t;
typedef uint32_t flex_uint32_t;
#else
typedef signed char flex_int8_t;
typedef short int flex_int16_t;
typedef int flex_int32_t;
typedef unsigned char flex_uint8_t;
typedef unsigned short int flex_uint16_t;
typedef unsigned int flex_uint32_t;
#endif /* ! C99 */
/* Limits of integral types. */
#ifndef INT8_MIN
#define INT8_MIN (-128)
#endif
#ifndef INT16_MIN
#define INT16_MIN (-32767-1)
#endif
#ifndef INT32_MIN
#define INT32_MIN (-2147483647-1)
#endif
#ifndef INT8_MAX
#define INT8_MAX (127)
#endif
#ifndef INT16_MAX
#define INT16_MAX (32767)
#endif
#ifndef INT32_MAX
#define INT32_MAX (2147483647)
#endif
#ifndef UINT8_MAX
#define UINT8_MAX (255U)
#endif
#ifndef UINT16_MAX
#define UINT16_MAX (65535U)
#endif
#ifndef UINT32_MAX
#define UINT32_MAX (4294967295U)
#endif
#endif /* ! FLEXINT_H */
#ifdef __cplusplus
/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST
#else /* ! __cplusplus */
#if __STDC__
#define YY_USE_CONST
#endif /* __STDC__ */
#endif /* ! __cplusplus */
#ifdef YY_USE_CONST
#define yyconst const
#else
#define yyconst
#endif
/* Returned upon end-of-file. */
#define YY_NULL 0
/* Promotes a possibly negative, possibly signed char to an unsigned
* integer for use as an array index. If the signed char is negative,
* we want to instead treat it as an 8-bit unsigned char, hence the
* double cast.
*/
#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
/* Enter a start condition. This macro really ought to take a parameter,
* but we do it the disgusting crufty way forced on us by the ()-less
* definition of BEGIN.
*/
#define BEGIN (yy_start) = 1 + 2 *
/* Translate the current start state into a value that can be later handed
* to BEGIN to return to the state. The YYSTATE alias is for lex
* compatibility.
*/
#define YY_START (((yy_start) - 1) / 2)
#define YYSTATE YY_START
/* Action number for EOF rule of a given start state. */
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
/* Special action meaning "start processing a new file". */
#define YY_NEW_FILE llvmAsmrestart(llvmAsmin )
#define YY_END_OF_BUFFER_CHAR 0
/* Size of default input buffer. */
#ifndef YY_BUF_SIZE
#define YY_BUF_SIZE (16384*64)
#endif
/* The state buf must be large enough to hold one state per character in the main buffer.
*/
#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
#ifndef YY_TYPEDEF_YY_BUFFER_STATE
#define YY_TYPEDEF_YY_BUFFER_STATE
typedef struct yy_buffer_state *YY_BUFFER_STATE;
#endif
extern int llvmAsmleng;
extern FILE *llvmAsmin, *llvmAsmout;
#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2
/* Note: We specifically omit the test for yy_rule_can_match_eol because it requires
* access to the local variable yy_act. Since yyless() is a macro, it would break
* existing scanners that call yyless() from OUTSIDE llvmAsmlex.
* One obvious solution it to make yy_act a global. I tried that, and saw
* a 5% performance hit in a non-llvmAsmlineno scanner, because yy_act is
* normally declared as a register variable-- so it is not worth it.
*/
#define YY_LESS_LINENO(n) \
do { \
int yyl;\
for ( yyl = n; yyl < llvmAsmleng; ++yyl )\
if ( llvmAsmtext[yyl] == '\n' )\
--llvmAsmlineno;\
}while(0)
/* Return all but the first "n" matched characters back to the input stream. */
#define yyless(n) \
do \
{ \
/* Undo effects of setting up llvmAsmtext. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
*yy_cp = (yy_hold_char); \
YY_RESTORE_YY_MORE_OFFSET \
(yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
YY_DO_BEFORE_ACTION; /* set up llvmAsmtext 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).
*/
#ifndef YY_TYPEDEF_YY_SIZE_T
#define YY_TYPEDEF_YY_SIZE_T
typedef unsigned int yy_size_t;
#endif
#ifndef YY_STRUCT_YY_BUFFER_STATE
#define YY_STRUCT_YY_BUFFER_STATE
struct yy_buffer_state
{
FILE *yy_input_file;
char *yy_ch_buf; /* input buffer */
char *yy_buf_pos; /* current position in input buffer */
/* Size of input buffer in bytes, not including room for EOB
* characters.
*/
yy_size_t yy_buf_size;
/* Number of characters read into yy_ch_buf, not including EOB
* characters.
*/
int yy_n_chars;
/* Whether we "own" the buffer - i.e., we know we created it,
* and can realloc() it to grow it, and should free() it to
* delete it.
*/
int yy_is_our_buffer;
/* Whether this is an "interactive" input source; if so, and
* if we're using stdio for input, then we want to use getc()
* instead of fread(), to make sure we stop fetching input after
* each newline.
*/
int yy_is_interactive;
/* Whether we're considered to be at the beginning of a line.
* If so, '^' rules will be active on the next match, otherwise
* not.
*/
int yy_at_bol;
int yy_bs_lineno; /**< The line count. */
int yy_bs_column; /**< The column count. */
/* Whether to try to fill the input buffer when we reach the
* end of it.
*/
int yy_fill_buffer;
int yy_buffer_status;
#define YY_BUFFER_NEW 0
#define YY_BUFFER_NORMAL 1
/* When an EOF's been seen but there's still some text to process
* then we mark the buffer as YY_EOF_PENDING, to indicate that we
* shouldn't try reading from the input source any more. We might
* still have a bunch of tokens to match, though, because of
* possible backing-up.
*
* When we actually see the EOF, we change the status to "new"
* (via llvmAsmrestart()), so that the user can continue scanning by
* just pointing llvmAsmin at a new input file.
*/
#define YY_BUFFER_EOF_PENDING 2
};
#endif /* !YY_STRUCT_YY_BUFFER_STATE */
/* Stack of input buffers. */
static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */
/* We provide macros for accessing buffer states in case in the
* future we want to put the buffer states in a more general
* "scanner state".
*
* Returns the top of the stack, or NULL.
*/
#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
? (yy_buffer_stack)[(yy_buffer_stack_top)] \
: NULL)
/* Same as previous macro, but useful when we know that the buffer stack is not
* NULL or when we need an lvalue. For internal use only.
*/
#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]
/* yy_hold_char holds the character lost when llvmAsmtext is formed. */
static char yy_hold_char;
static int yy_n_chars; /* number of characters read into yy_ch_buf */
int llvmAsmleng;
/* Points to current character in buffer. */
static char *yy_c_buf_p = (char *) 0;
static int yy_init = 0; /* whether we need to initialize */
static int yy_start = 0; /* start state number */
/* Flag which is used to allow llvmAsmwrap()'s to do buffer switches
* instead of setting up a fresh llvmAsmin. A bit of a hack ...
*/
static int yy_did_buffer_switch_on_eof;
void llvmAsmrestart (FILE *input_file );
void llvmAsm_switch_to_buffer (YY_BUFFER_STATE new_buffer );
YY_BUFFER_STATE llvmAsm_create_buffer (FILE *file,int size );
void llvmAsm_delete_buffer (YY_BUFFER_STATE b );
void llvmAsm_flush_buffer (YY_BUFFER_STATE b );
void llvmAsmpush_buffer_state (YY_BUFFER_STATE new_buffer );
void llvmAsmpop_buffer_state (void );
static void llvmAsmensure_buffer_stack (void );
static void llvmAsm_load_buffer_state (void );
static void llvmAsm_init_buffer (YY_BUFFER_STATE b,FILE *file );
#define YY_FLUSH_BUFFER llvmAsm_flush_buffer(YY_CURRENT_BUFFER )
YY_BUFFER_STATE llvmAsm_scan_buffer (char *base,yy_size_t size );
YY_BUFFER_STATE llvmAsm_scan_string (yyconst char *yy_str );
YY_BUFFER_STATE llvmAsm_scan_bytes (yyconst char *bytes,int len );
void *llvmAsmalloc (yy_size_t );
void *llvmAsmrealloc (void *,yy_size_t );
void llvmAsmfree (void * );
#define yy_new_buffer llvmAsm_create_buffer
#define yy_set_interactive(is_interactive) \
{ \
if ( ! YY_CURRENT_BUFFER ){ \
llvmAsmensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
llvmAsm_create_buffer(llvmAsmin,YY_BUF_SIZE ); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
}
#define yy_set_bol(at_bol) \
{ \
if ( ! YY_CURRENT_BUFFER ){\
llvmAsmensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
llvmAsm_create_buffer(llvmAsmin,YY_BUF_SIZE ); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
}
#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
/* Begin user sect3 */
#define llvmAsmwrap() 1
#define YY_SKIP_YYWRAP
typedef unsigned char YY_CHAR;
FILE *llvmAsmin = (FILE *) 0, *llvmAsmout = (FILE *) 0;
typedef int yy_state_type;
extern int llvmAsmlineno;
int llvmAsmlineno = 1;
extern char *llvmAsmtext;
#define yytext_ptr llvmAsmtext
static yy_state_type yy_get_previous_state (void );
static yy_state_type yy_try_NUL_trans (yy_state_type current_state );
static int yy_get_next_buffer (void );
static void yy_fatal_error (yyconst char msg[] );
/* Done after the current pattern has been matched and before the
* corresponding action - sets up llvmAsmtext.
*/
#define YY_DO_BEFORE_ACTION \
(yytext_ptr) = yy_bp; \
llvmAsmleng = (size_t) (yy_cp - yy_bp); \
(yy_hold_char) = *yy_cp; \
*yy_cp = '\0'; \
(yy_c_buf_p) = yy_cp;
#define YY_NUM_RULES 136
#define YY_END_OF_BUFFER 137
/* This struct is not used in this scanner,
but its presence is necessary. */
struct yy_trans_info
{
flex_int32_t yy_verify;
flex_int32_t yy_nxt;
};
static yyconst flex_int16_t yy_accept[550] =
{ 0,
0, 0, 137, 135, 134, 134, 135, 135, 135, 135,
135, 135, 127, 127, 1, 135, 135, 135, 135, 135,
135, 135, 135, 135, 135, 135, 135, 135, 135, 135,
135, 135, 135, 135, 135, 135, 135, 135, 0, 125,
0, 123, 121, 130, 0, 128, 0, 132, 127, 0,
1, 0, 122, 131, 0, 0, 0, 0, 0, 0,
0, 107, 0, 36, 0, 0, 0, 0, 0, 0,
70, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 52, 0, 0, 0, 0, 0, 0, 0, 0,
0, 71, 0, 0, 0, 0, 0, 0, 0, 66,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 24, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 125, 121, 132, 21, 132, 0, 133, 0,
126, 122, 53, 0, 0, 65, 0, 0, 34, 0,
0, 0, 37, 0, 0, 0, 0, 0, 0, 0,
0, 3, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 55, 0, 0, 0, 80,
85, 83, 84, 82, 81, 0, 86, 90, 0, 106,
0, 0, 0, 0, 0, 75, 73, 62, 0, 0,
0, 74, 72, 0, 0, 54, 0, 0, 0, 0,
0, 0, 0, 0, 88, 79, 77, 0, 78, 76,
0, 89, 87, 0, 0, 0, 0, 0, 0, 0,
0, 67, 0, 0, 124, 132, 0, 0, 0, 132,
0, 0, 0, 64, 0, 0, 91, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
69, 58, 0, 0, 0, 0, 114, 61, 0, 0,
0, 68, 0, 0, 0, 0, 0, 0, 0, 115,
63, 0, 0, 0, 0, 23, 0, 0, 129, 57,
0, 0, 94, 0, 0, 0, 60, 43, 0, 0,
25, 0, 0, 0, 4, 0, 50, 56, 0, 0,
0, 0, 59, 0, 46, 0, 12, 0, 0, 93,
132, 31, 0, 0, 2, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 5, 0, 47,
96, 0, 0, 0, 0, 0, 0, 42, 0, 0,
0, 0, 49, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 116, 0, 0, 0, 0,
92, 0, 22, 0, 0, 0, 0, 0, 0, 0,
113, 0, 0, 39, 0, 0, 0, 7, 0, 0,
0, 48, 0, 0, 38, 100, 99, 0, 0, 8,
16, 0, 0, 0, 109, 0, 112, 33, 0, 0,
51, 0, 0, 104, 0, 0, 98, 108, 26, 0,
27, 97, 0, 110, 105, 0, 0, 0, 0, 0,
103, 0, 0, 6, 28, 0, 0, 0, 0, 0,
95, 0, 0, 0, 0, 0, 0, 0, 0, 32,
0, 0, 0, 0, 0, 0, 0, 0, 0, 9,
0, 0, 0, 0, 18, 0, 0, 0, 10, 101,
11, 45, 44, 102, 0, 0, 0, 0, 30, 0,
0, 0, 13, 0, 15, 14, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 29, 0, 0,
0, 0, 0, 35, 0, 0, 0, 0, 0, 17,
0, 0, 0, 0, 0, 111, 0, 0, 0, 0,
0, 0, 0, 19, 0, 0, 0, 0, 117, 119,
120, 0, 40, 0, 118, 41, 0, 20, 0
} ;
static yyconst flex_int32_t 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, 12, 11, 13, 11, 14, 15, 1,
1, 1, 1, 16, 17, 17, 17, 17, 18, 17,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
1, 1, 1, 1, 19, 1, 20, 21, 22, 23,
24, 25, 26, 27, 28, 5, 29, 30, 31, 32,
33, 34, 35, 36, 37, 38, 39, 40, 41, 42,
43, 44, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1
} ;
static yyconst flex_int32_t yy_meta[45] =
{ 0,
1, 1, 2, 3, 4, 1, 1, 4, 4, 4,
4, 4, 4, 5, 1, 1, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4
} ;
static yyconst flex_int16_t yy_base[558] =
{ 0,
0, 0, 1197, 1198, 1198, 1198, 1192, 1181, 35, 39,
43, 49, 55, 61, 0, 72, 64, 67, 66, 86,
76, 106, 91, 65, 133, 121, 117, 99, 152, 95,
78, 179, 137, 211, 139, 90, 148, 93, 1190, 1198,
1179, 1198, 0, 49, 185, 217, 116, 238, 254, 259,
0, 1188, 0, 200, 125, 149, 146, 153, 177, 63,
154, 1177, 160, 161, 208, 185, 264, 171, 113, 210,
1176, 222, 260, 228, 186, 261, 271, 110, 273, 274,
230, 289, 277, 278, 240, 290, 292, 205, 291, 232,
296, 1175, 299, 303, 305, 306, 310, 313, 309, 318,
311, 314, 317, 322, 328, 329, 338, 331, 335, 339,
333, 332, 346, 340, 352, 355, 1174, 358, 360, 361,
364, 368, 365, 369, 381, 376, 382, 388, 367, 396,
384, 395, 1173, 0, 414, 1172, 429, 447, 0, 1181,
1198, 0, 1170, 231, 397, 1169, 399, 398, 1168, 401,
414, 405, 1167, 442, 407, 431, 419, 434, 436, 449,
450, 1166, 454, 432, 438, 453, 456, 460, 458, 461,
467, 465, 471, 470, 468, 481, 485, 487, 474, 489,
490, 492, 472, 496, 498, 1165, 500, 502, 503, 1164,
1163, 1162, 1161, 1160, 1159, 504, 1158, 1157, 506, 1156,
535, 509, 513, 507, 516, 1155, 1154, 1153, 515, 508,
528, 1152, 1151, 536, 527, 1150, 524, 550, 551, 552,
554, 555, 557, 556, 1149, 1148, 1147, 558, 1146, 1145,
559, 1144, 1143, 561, 564, 568, 570, 572, 580, 514,
579, 1142, 575, 583, 1198, 591, 606, 612, 616, 621,
606, 622, 623, 1141, 625, 591, 1140, 626, 627, 628,
592, 629, 631, 632, 633, 636, 635, 640, 638, 653,
1139, 1138, 639, 642, 649, 637, 1137, 1136, 654, 658,
655, 1135, 656, 659, 667, 669, 671, 675, 673, 1134,
1133, 676, 677, 678, 679, 1132, 680, 682, 0, 1131,
683, 690, 1130, 685, 684, 699, 1129, 1128, 703, 700,
1127, 704, 709, 707, 1126, 711, 1125, 1124, 716, 717,
712, 720, 1123, 721, 1122, 722, 1121, 724, 725, 1120,
733, 1119, 734, 733, 1118, 726, 736, 745, 748, 737,
750, 755, 741, 752, 753, 756, 757, 1117, 758, 1116,
1115, 764, 767, 768, 769, 771, 770, 1114, 773, 775,
776, 780, 1113, 777, 783, 782, 784, 785, 794, 789,
798, 800, 802, 801, 805, 1112, 806, 807, 811, 813,
1111, 808, 1110, 814, 821, 815, 826, 810, 829, 832,
1109, 833, 834, 1108, 836, 835, 838, 1107, 837, 842,
843, 1106, 839, 841, 1105, 1104, 1103, 849, 846, 1102,
1101, 856, 867, 851, 1100, 868, 1099, 1098, 852, 859,
1097, 869, 870, 1096, 871, 872, 1095, 1094, 1093, 879,
1092, 1091, 878, 1090, 1089, 880, 882, 885, 886, 889,
1088, 890, 892, 1087, 1076, 893, 895, 897, 902, 898,
1066, 899, 903, 904, 901, 906, 910, 912, 913, 1065,
922, 925, 926, 927, 929, 930, 932, 931, 934, 1064,
936, 938, 941, 943, 1061, 944, 945, 947, 1060, 1059,
1058, 1057, 1056, 1055, 949, 950, 951, 964, 1054, 966,
967, 968, 1048, 952, 1047, 1046, 969, 977, 956, 972,
978, 979, 983, 981, 984, 985, 988, 855, 992, 993,
995, 996, 998, 687, 999, 1002, 1000, 1004, 1008, 596,
1009, 1011, 1013, 1014, 1018, 593, 1021, 1017, 1026, 1023,
1027, 1028, 1029, 522, 1030, 1036, 1032, 1039, 521, 469,
371, 1042, 370, 1043, 282, 279, 1045, 244, 1198, 1081,
1083, 212, 1088, 1091, 167, 1095, 108
} ;
static yyconst flex_int16_t yy_def[558] =
{ 0,
549, 1, 549, 549, 549, 549, 550, 551, 552, 549,
551, 551, 551, 551, 553, 554, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 550, 549,
551, 549, 555, 549, 549, 551, 551, 551, 551, 551,
553, 556, 557, 549, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 549, 555, 549, 551, 551, 551, 50, 556,
549, 557, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
50, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 549, 549, 549, 549, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 201, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
549, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 551, 551,
551, 551, 551, 551, 551, 551, 551, 551, 0, 549,
549, 549, 549, 549, 549, 549, 549
} ;
static yyconst flex_int16_t yy_nxt[1243] =
{ 0,
4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
14, 14, 14, 4, 15, 16, 8, 8, 8, 17,
18, 19, 20, 21, 22, 23, 24, 25, 8, 26,
27, 28, 29, 30, 8, 31, 32, 33, 34, 35,
36, 37, 8, 38, 44, 44, 44, 44, 45, 45,
45, 45, 46, 46, 46, 46, 42, 47, 44, 44,
44, 44, 42, 48, 49, 49, 49, 49, 42, 48,
49, 49, 49, 49, 42, 52, 42, 42, 42, 42,
42, 54, 54, 54, 54, 63, 55, 64, 150, 42,
60, 42, 81, 56, 61, 57, 50, 58, 65, 42,
59, 103, 62, 42, 42, 66, 42, 70, 42, 67,
71, 142, 42, 129, 79, 68, 132, 72, 69, 42,
80, 101, 92, 42, 136, 73, 42, 74, 75, 42,
42, 93, 102, 171, 42, 76, 89, 94, 42, 77,
85, 78, 82, 82, 82, 82, 42, 143, 86, 90,
42, 161, 42, 87, 83, 91, 115, 88, 127, 42,
130, 42, 42, 116, 84, 42, 42, 42, 146, 117,
134, 128, 118, 42, 42, 95, 144, 96, 145, 119,
131, 97, 153, 98, 42, 99, 147, 100, 104, 152,
42, 151, 42, 135, 45, 45, 45, 45, 42, 42,
160, 105, 106, 148, 107, 108, 109, 149, 110, 54,
54, 54, 54, 167, 111, 43, 112, 113, 42, 114,
104, 42, 156, 42, 42, 48, 46, 46, 46, 46,
42, 183, 162, 120, 121, 42, 122, 154, 123, 155,
124, 42, 125, 42, 42, 42, 126, 137, 137, 137,
137, 42, 174, 42, 185, 138, 251, 42, 166, 163,
180, 138, 48, 49, 49, 49, 49, 42, 139, 139,
139, 139, 42, 42, 42, 139, 139, 42, 139, 139,
139, 139, 139, 139, 42, 157, 42, 42, 158, 164,
42, 42, 42, 168, 169, 42, 165, 159, 82, 82,
82, 82, 42, 42, 42, 42, 173, 175, 170, 42,
172, 182, 42, 176, 177, 178, 42, 179, 42, 42,
184, 181, 42, 42, 42, 186, 42, 42, 196, 191,
42, 42, 189, 193, 187, 42, 195, 188, 198, 190,
197, 42, 42, 192, 42, 42, 42, 194, 42, 199,
203, 42, 42, 42, 200, 202, 214, 210, 204, 42,
208, 206, 212, 201, 215, 42, 216, 217, 42, 209,
205, 42, 211, 42, 42, 207, 213, 42, 42, 218,
42, 42, 42, 42, 42, 221, 240, 219, 224, 42,
220, 226, 229, 223, 42, 42, 222, 42, 225, 236,
237, 42, 228, 231, 232, 227, 230, 241, 42, 42,
42, 42, 42, 233, 42, 238, 234, 239, 42, 242,
42, 235, 253, 246, 246, 246, 246, 42, 255, 252,
243, 247, 42, 254, 257, 256, 244, 247, 137, 137,
137, 137, 42, 259, 42, 42, 138, 42, 261, 42,
260, 42, 138, 248, 249, 42, 250, 250, 250, 250,
42, 262, 42, 42, 258, 263, 42, 42, 269, 42,
266, 42, 264, 42, 42, 270, 265, 267, 42, 273,
42, 42, 42, 42, 42, 42, 271, 42, 279, 268,
277, 280, 281, 275, 42, 272, 276, 278, 42, 274,
42, 282, 42, 42, 283, 42, 287, 291, 284, 42,
285, 42, 288, 42, 290, 42, 42, 42, 289, 42,
42, 42, 42, 294, 286, 292, 42, 42, 42, 42,
302, 305, 296, 295, 42, 42, 293, 42, 297, 304,
42, 42, 327, 298, 299, 299, 299, 299, 300, 42,
301, 299, 299, 303, 299, 299, 299, 299, 299, 299,
306, 310, 309, 42, 42, 42, 307, 42, 42, 42,
42, 42, 42, 308, 42, 313, 312, 42, 315, 311,
317, 42, 320, 42, 321, 42, 316, 314, 42, 324,
319, 322, 42, 42, 325, 318, 42, 328, 323, 326,
246, 246, 246, 246, 42, 42, 42, 329, 247, 42,
336, 340, 248, 248, 247, 331, 331, 331, 331, 42,
330, 331, 331, 331, 331, 250, 250, 250, 250, 42,
250, 250, 250, 250, 42, 42, 42, 332, 42, 42,
42, 42, 42, 333, 42, 42, 42, 337, 42, 42,
42, 42, 42, 42, 334, 42, 335, 339, 342, 347,
341, 348, 42, 344, 338, 345, 42, 42, 42, 42,
346, 42, 42, 343, 349, 354, 350, 356, 357, 351,
42, 358, 42, 355, 42, 352, 42, 353, 42, 42,
42, 42, 42, 42, 359, 42, 42, 42, 42, 362,
42, 361, 360, 42, 363, 364, 366, 374, 365, 373,
371, 372, 42, 42, 370, 367, 42, 42, 369, 368,
42, 377, 42, 375, 42, 42, 376, 378, 379, 42,
42, 384, 381, 42, 42, 42, 380, 42, 42, 42,
382, 383, 331, 331, 331, 331, 42, 42, 388, 42,
42, 385, 390, 391, 42, 392, 386, 394, 42, 387,
389, 42, 393, 42, 395, 42, 42, 396, 42, 42,
42, 42, 397, 398, 400, 399, 402, 42, 404, 405,
42, 42, 42, 42, 42, 401, 42, 403, 42, 42,
42, 406, 409, 42, 407, 42, 42, 42, 42, 408,
410, 411, 42, 415, 417, 418, 413, 42, 416, 414,
412, 42, 420, 42, 42, 42, 422, 421, 42, 42,
42, 42, 419, 42, 42, 426, 42, 42, 42, 437,
423, 425, 428, 430, 42, 433, 431, 424, 427, 42,
435, 432, 42, 434, 429, 42, 42, 42, 42, 42,
42, 42, 42, 436, 42, 42, 42, 448, 449, 42,
440, 444, 42, 439, 42, 42, 438, 442, 42, 42,
451, 441, 42, 445, 446, 447, 452, 443, 450, 453,
42, 42, 42, 42, 42, 42, 454, 457, 455, 456,
458, 42, 42, 42, 461, 42, 462, 463, 42, 42,
459, 460, 42, 42, 464, 42, 42, 467, 42, 465,
42, 42, 42, 468, 42, 42, 42, 42, 466, 42,
469, 476, 477, 42, 471, 42, 42, 470, 472, 481,
473, 475, 478, 479, 483, 42, 480, 474, 42, 42,
42, 482, 42, 42, 42, 42, 488, 42, 486, 42,
484, 42, 489, 491, 42, 487, 42, 42, 42, 493,
42, 485, 42, 42, 42, 42, 497, 490, 492, 42,
500, 502, 501, 498, 494, 495, 499, 42, 496, 42,
42, 42, 42, 503, 504, 42, 506, 505, 509, 508,
42, 42, 42, 511, 42, 507, 42, 42, 42, 513,
510, 42, 512, 517, 515, 42, 42, 519, 42, 42,
516, 42, 42, 42, 518, 42, 514, 42, 525, 523,
520, 42, 42, 521, 42, 526, 42, 42, 522, 527,
42, 42, 530, 528, 42, 524, 42, 529, 536, 42,
42, 42, 42, 42, 532, 42, 533, 534, 531, 42,
535, 542, 42, 537, 538, 42, 42, 543, 42, 42,
42, 42, 539, 546, 541, 540, 547, 42, 42, 42,
42, 42, 42, 42, 42, 544, 545, 42, 42, 42,
548, 39, 39, 39, 39, 39, 41, 41, 51, 42,
51, 51, 51, 53, 53, 140, 140, 140, 140, 140,
42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
42, 42, 42, 42, 141, 42, 245, 42, 42, 42,
42, 141, 42, 133, 42, 40, 549, 3, 549, 549,
549, 549, 549, 549, 549, 549, 549, 549, 549, 549,
549, 549, 549, 549, 549, 549, 549, 549, 549, 549,
549, 549, 549, 549, 549, 549, 549, 549, 549, 549,
549, 549, 549, 549, 549, 549, 549, 549, 549, 549,
549, 549
} ;
static yyconst flex_int16_t yy_chk[1243] =
{ 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, 9, 9, 9, 9, 10, 10,
10, 10, 11, 11, 11, 11, 11, 12, 44, 44,
44, 44, 12, 13, 13, 13, 13, 13, 13, 14,
14, 14, 14, 14, 14, 16, 60, 17, 24, 19,
18, 16, 16, 16, 16, 19, 17, 19, 60, 21,
18, 31, 24, 17, 18, 17, 13, 17, 19, 20,
17, 31, 18, 36, 23, 20, 38, 21, 30, 20,
21, 557, 28, 36, 23, 20, 38, 21, 20, 22,
23, 30, 28, 78, 47, 22, 69, 22, 22, 47,
27, 28, 30, 78, 26, 22, 27, 28, 55, 22,
26, 22, 25, 25, 25, 25, 25, 55, 26, 27,
33, 69, 35, 26, 25, 27, 33, 26, 35, 57,
37, 37, 56, 33, 25, 29, 58, 61, 57, 33,
555, 35, 33, 63, 64, 29, 56, 29, 56, 33,
37, 29, 64, 29, 68, 29, 58, 29, 32, 63,
59, 61, 32, 45, 45, 45, 45, 45, 66, 75,
68, 32, 32, 59, 32, 32, 32, 59, 32, 54,
54, 54, 54, 75, 32, 552, 32, 32, 88, 32,
34, 65, 66, 70, 34, 46, 46, 46, 46, 46,
46, 88, 70, 34, 34, 72, 34, 65, 34, 65,
34, 74, 34, 81, 144, 90, 34, 48, 48, 48,
48, 48, 81, 85, 90, 48, 144, 548, 74, 72,
85, 48, 49, 49, 49, 49, 49, 49, 50, 50,
50, 50, 50, 73, 76, 50, 50, 67, 50, 50,
50, 50, 50, 50, 77, 67, 79, 80, 67, 73,
83, 84, 546, 76, 77, 545, 73, 67, 82, 82,
82, 82, 82, 86, 89, 87, 80, 83, 77, 91,
79, 87, 93, 84, 84, 84, 94, 84, 95, 96,
89, 86, 99, 97, 101, 91, 98, 102, 99, 96,
103, 100, 94, 97, 93, 104, 98, 93, 101, 95,
100, 105, 106, 96, 108, 112, 111, 97, 109, 102,
106, 107, 110, 114, 103, 105, 111, 109, 106, 113,
108, 107, 110, 104, 112, 115, 113, 114, 116, 108,
106, 118, 109, 119, 120, 107, 110, 121, 123, 115,
129, 122, 124, 543, 541, 118, 129, 115, 120, 126,
116, 122, 124, 119, 125, 127, 118, 131, 121, 126,
127, 128, 123, 125, 125, 122, 124, 130, 132, 130,
145, 148, 147, 125, 150, 128, 125, 128, 152, 131,
155, 125, 147, 135, 135, 135, 135, 151, 150, 145,
132, 135, 157, 148, 152, 151, 132, 135, 137, 137,
137, 137, 137, 155, 156, 164, 137, 158, 157, 159,
156, 165, 137, 138, 138, 154, 138, 138, 138, 138,
138, 158, 160, 161, 154, 159, 166, 163, 164, 167,
161, 169, 160, 168, 170, 165, 160, 163, 172, 168,
171, 175, 540, 174, 173, 183, 166, 179, 172, 163,
171, 173, 174, 170, 176, 167, 170, 171, 177, 169,
178, 175, 180, 181, 176, 182, 179, 183, 177, 184,
178, 185, 180, 187, 182, 188, 189, 196, 181, 199,
204, 210, 202, 187, 178, 184, 203, 240, 209, 205,
204, 210, 189, 188, 539, 534, 185, 217, 196, 209,
215, 211, 240, 199, 201, 201, 201, 201, 202, 214,
203, 201, 201, 205, 201, 201, 201, 201, 201, 201,
211, 217, 215, 218, 219, 220, 214, 221, 222, 224,
223, 228, 231, 214, 234, 220, 219, 235, 222, 218,
223, 236, 231, 237, 234, 238, 222, 221, 243, 237,
228, 235, 241, 239, 238, 224, 244, 241, 236, 239,
246, 246, 246, 246, 256, 261, 526, 243, 246, 520,
256, 261, 247, 247, 246, 247, 247, 247, 247, 251,
244, 248, 248, 248, 248, 249, 249, 249, 249, 249,
250, 250, 250, 250, 250, 252, 253, 251, 255, 258,
259, 260, 262, 252, 263, 264, 265, 258, 267, 266,
276, 269, 273, 268, 253, 274, 255, 260, 263, 268,
262, 269, 275, 265, 259, 266, 270, 279, 281, 283,
267, 280, 284, 264, 270, 276, 273, 280, 281, 274,
285, 283, 286, 279, 287, 275, 289, 275, 288, 292,
293, 294, 295, 297, 284, 298, 301, 305, 304, 287,
514, 286, 285, 302, 288, 289, 293, 305, 292, 304,
301, 302, 306, 310, 298, 294, 309, 312, 297, 295,
314, 310, 313, 306, 316, 321, 309, 312, 313, 319,
320, 321, 316, 322, 324, 326, 314, 328, 329, 336,
319, 320, 331, 331, 331, 331, 334, 333, 328, 337,
340, 322, 329, 333, 343, 334, 324, 337, 338, 326,
328, 339, 336, 341, 338, 344, 345, 339, 342, 346,
347, 349, 340, 341, 343, 342, 345, 352, 347, 349,
353, 354, 355, 357, 356, 344, 359, 346, 360, 361,
364, 352, 355, 362, 353, 366, 365, 367, 368, 354,
356, 357, 370, 362, 365, 366, 360, 369, 364, 361,
359, 371, 368, 372, 374, 373, 370, 369, 375, 377,
378, 382, 367, 388, 379, 374, 380, 384, 386, 388,
371, 373, 377, 379, 385, 384, 380, 372, 375, 387,
386, 382, 389, 385, 378, 390, 392, 393, 396, 395,
399, 397, 403, 387, 404, 400, 401, 403, 403, 409,
392, 397, 408, 390, 414, 419, 389, 395, 508, 412,
408, 393, 420, 399, 400, 401, 409, 396, 404, 412,
413, 416, 422, 423, 425, 426, 413, 419, 414, 416,
420, 433, 430, 436, 425, 437, 426, 430, 438, 439,
422, 423, 440, 442, 433, 443, 446, 438, 447, 436,
448, 450, 452, 439, 455, 449, 453, 454, 437, 456,
440, 450, 452, 457, 443, 458, 459, 442, 446, 456,
447, 449, 453, 454, 458, 461, 455, 448, 462, 463,
464, 457, 465, 466, 468, 467, 464, 469, 462, 471,
459, 472, 465, 467, 473, 463, 474, 476, 477, 469,
478, 461, 485, 486, 487, 494, 474, 466, 468, 499,
478, 486, 485, 476, 471, 472, 477, 488, 473, 490,
491, 492, 497, 487, 488, 500, 491, 490, 497, 494,
498, 501, 502, 499, 504, 492, 503, 505, 506, 501,
498, 507, 500, 505, 503, 509, 510, 507, 511, 512,
504, 513, 515, 517, 506, 516, 502, 518, 515, 512,
509, 519, 521, 510, 522, 516, 523, 524, 511, 517,
528, 525, 521, 518, 527, 513, 530, 519, 528, 529,
531, 532, 533, 535, 523, 537, 524, 525, 522, 536,
527, 535, 538, 529, 530, 542, 544, 536, 547, 496,
495, 493, 531, 542, 533, 532, 544, 489, 484, 483,
482, 481, 480, 479, 475, 537, 538, 470, 460, 451,
547, 550, 550, 550, 550, 550, 551, 551, 553, 445,
553, 553, 553, 554, 554, 556, 556, 556, 556, 556,
444, 441, 435, 434, 432, 431, 429, 428, 427, 424,
421, 418, 417, 415, 411, 410, 407, 406, 405, 402,
398, 394, 391, 383, 381, 376, 363, 358, 351, 350,
348, 335, 332, 330, 327, 325, 323, 318, 317, 315,
311, 308, 307, 303, 300, 296, 291, 290, 282, 278,
277, 272, 271, 257, 254, 242, 233, 232, 230, 229,
227, 226, 225, 216, 213, 212, 208, 207, 206, 200,
198, 197, 195, 194, 193, 192, 191, 190, 186, 162,
153, 149, 146, 143, 140, 136, 133, 117, 92, 71,
62, 52, 41, 39, 8, 7, 3, 549, 549, 549,
549, 549, 549, 549, 549, 549, 549, 549, 549, 549,
549, 549, 549, 549, 549, 549, 549, 549, 549, 549,
549, 549, 549, 549, 549, 549, 549, 549, 549, 549,
549, 549, 549, 549, 549, 549, 549, 549, 549, 549,
549, 549
} ;
/* Table of booleans, true if rule could match eol. */
static yyconst flex_int32_t yy_rule_can_match_eol[137] =
{ 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, };
static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;
extern int llvmAsm_flex_debug;
int llvmAsm_flex_debug = 0;
/* The intent behind this definition is that it'll catch
* any uses of REJECT which flex missed.
*/
#define REJECT reject_used_but_not_detected
#define yymore() yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
char *llvmAsmtext;
#line 1 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
/*===-- 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.
//
//===----------------------------------------------------------------------===*/
#line 28 "/home/laurov/llvm/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){
llvmAsm_switch_to_buffer(llvmAsm_create_buffer(F,YY_BUF_SIZE ) );
}
void set_scan_string (const char * str) {
llvmAsm_scan_string (str);
}
// Construct a token value for a non-obsolete token
#define RET_TOK(type, Enum, sym) \
llvmAsmlval.type = Instruction::Enum; \
return sym
// Construct a token value for an obsolete token
#define RET_TY(CTYPE, SYM) \
llvmAsmlval.PrimType = CTYPE;\
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!!!
GenerateError("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!!!
GenerateError("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)
GenerateError("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 */
/* Local Values and Type identifiers start with a % sign */
/* Global Value identifiers start with an @ sign */
/* Label identifiers end with a colon */
/* Quoted names can contain any character except " and \ */
/* LocalVarID/GlobalVarID: match an unnamed local variable slot ID. */
/* Integer types are specified with i and a bitwidth */
/* 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 1081 "Lexer.cpp"
#define INITIAL 0
#ifndef YY_NO_UNISTD_H
/* Special case for "unistd.h", since it is non-ANSI. We include it way
* down here because we want the user's section 1 to have been scanned first.
* The user has a chance to override it with an option.
*/
#include <unistd.h>
#endif
#ifndef YY_EXTRA_TYPE
#define YY_EXTRA_TYPE void *
#endif
static int yy_init_globals (void );
/* Macros after this point can all be overridden by user definitions in
* section 1.
*/
#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int llvmAsmwrap (void );
#else
extern int llvmAsmwrap (void );
#endif
#endif
static inline void yyunput (int c,char *buf_ptr );
#ifndef yytext_ptr
static void yy_flex_strncpy (char *,yyconst char *,int );
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * );
#endif
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (void );
#else
static int input (void );
#endif
#endif
/* Amount of stuff to slurp up with each read. */
#ifndef YY_READ_BUF_SIZE
#define YY_READ_BUF_SIZE 8192
#endif
/* Copy whatever the last rule matched to the standard output. */
#ifndef ECHO
/* This used to be an fputs(), but since the string might contain NUL's,
* we now use fwrite().
*/
#define ECHO (void) fwrite( llvmAsmtext, llvmAsmleng, 1, llvmAsmout )
#endif
/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
* is returned in "result".
*/
#ifndef YY_INPUT
#define YY_INPUT(buf,result,max_size) \
if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
{ \
int c = '*'; \
size_t n; \
for ( n = 0; n < max_size && \
(c = getc( llvmAsmin )) != EOF && c != '\n'; ++n ) \
buf[n] = (char) c; \
if ( c == '\n' ) \
buf[n++] = (char) c; \
if ( c == EOF && ferror( llvmAsmin ) ) \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
result = n; \
} \
else \
{ \
errno=0; \
while ( (result = fread(buf, 1, max_size, llvmAsmin))==0 && ferror(llvmAsmin)) \
{ \
if( errno != EINTR) \
{ \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
break; \
} \
errno=0; \
clearerr(llvmAsmin); \
} \
}\
\
#endif
/* No semi-colon after return; correct usage is to write "yyterminate();" -
* we don't want an extra ';' after the "return" because that will cause
* some compilers to complain about unreachable statements.
*/
#ifndef yyterminate
#define yyterminate() return YY_NULL
#endif
/* Number of entries by which start-condition stack grows. */
#ifndef YY_START_STACK_INCR
#define YY_START_STACK_INCR 25
#endif
/* Report a fatal error. */
#ifndef YY_FATAL_ERROR
#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
#endif
/* end tables serialization structures and prototypes */
/* Default declaration of generated scanner - a define so the user can
* easily add parameters.
*/
#ifndef YY_DECL
#define YY_DECL_IS_OURS 1
extern int llvmAsmlex (void);
#define YY_DECL int llvmAsmlex (void)
#endif /* !YY_DECL */
/* Code executed at the beginning of each rule, after llvmAsmtext and llvmAsmleng
* 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
/** The main scanner function which does all the work.
*/
YY_DECL
{
register yy_state_type yy_current_state;
register char *yy_cp, *yy_bp;
register int yy_act;
#line 190 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
#line 1237 "Lexer.cpp"
if ( !(yy_init) )
{
(yy_init) = 1;
#ifdef YY_USER_INIT
YY_USER_INIT;
#endif
if ( ! (yy_start) )
(yy_start) = 1; /* first start state */
if ( ! llvmAsmin )
llvmAsmin = stdin;
if ( ! llvmAsmout )
llvmAsmout = stdout;
if ( ! YY_CURRENT_BUFFER ) {
llvmAsmensure_buffer_stack ();
YY_CURRENT_BUFFER_LVALUE =
llvmAsm_create_buffer(llvmAsmin,YY_BUF_SIZE );
}
llvmAsm_load_buffer_state( );
}
while ( 1 ) /* loops until end-of-file is reached */
{
yy_cp = (yy_c_buf_p);
/* Support of llvmAsmtext. */
*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_match:
do
{
register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 550 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
++yy_cp;
}
while ( yy_current_state != 549 );
yy_cp = (yy_last_accepting_cpos);
yy_current_state = (yy_last_accepting_state);
yy_find_action:
yy_act = yy_accept[yy_current_state];
YY_DO_BEFORE_ACTION;
if ( yy_act != YY_END_OF_BUFFER && yy_rule_can_match_eol[yy_act] )
{
int yyl;
for ( yyl = 0; yyl < llvmAsmleng; ++yyl )
if ( llvmAsmtext[yyl] == '\n' )
llvmAsmlineno++;
;
}
do_action: /* This label is used only to access EOF actions. */
switch ( yy_act )
{ /* beginning of action switch */
case 0: /* must back up */
/* undo the effects of YY_DO_BEFORE_ACTION */
*yy_cp = (yy_hold_char);
yy_cp = (yy_last_accepting_cpos);
yy_current_state = (yy_last_accepting_state);
goto yy_find_action;
case 1:
YY_RULE_SETUP
#line 192 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ /* Ignore comments for now */ }
YY_BREAK
case 2:
YY_RULE_SETUP
#line 194 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return BEGINTOK; }
YY_BREAK
case 3:
YY_RULE_SETUP
#line 195 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return ENDTOK; }
YY_BREAK
case 4:
YY_RULE_SETUP
#line 196 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return TRUETOK; }
YY_BREAK
case 5:
YY_RULE_SETUP
#line 197 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return FALSETOK; }
YY_BREAK
case 6:
YY_RULE_SETUP
#line 198 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return DECLARE; }
YY_BREAK
case 7:
YY_RULE_SETUP
#line 199 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return DEFINE; }
YY_BREAK
case 8:
YY_RULE_SETUP
#line 200 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return GLOBAL; }
YY_BREAK
case 9:
YY_RULE_SETUP
#line 201 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return CONSTANT; }
YY_BREAK
case 10:
YY_RULE_SETUP
#line 202 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return INTERNAL; }
YY_BREAK
case 11:
YY_RULE_SETUP
#line 203 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return LINKONCE; }
YY_BREAK
case 12:
YY_RULE_SETUP
#line 204 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return WEAK; }
YY_BREAK
case 13:
YY_RULE_SETUP
#line 205 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return APPENDING; }
YY_BREAK
case 14:
YY_RULE_SETUP
#line 206 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return DLLIMPORT; }
YY_BREAK
case 15:
YY_RULE_SETUP
#line 207 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return DLLEXPORT; }
YY_BREAK
case 16:
YY_RULE_SETUP
#line 208 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return HIDDEN; }
YY_BREAK
case 17:
YY_RULE_SETUP
#line 209 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return EXTERN_WEAK; }
YY_BREAK
case 18:
YY_RULE_SETUP
#line 210 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return EXTERNAL; }
YY_BREAK
case 19:
YY_RULE_SETUP
#line 211 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return THREAD_LOCAL; }
YY_BREAK
case 20:
YY_RULE_SETUP
#line 212 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return ZEROINITIALIZER; }
YY_BREAK
case 21:
YY_RULE_SETUP
#line 213 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return DOTDOTDOT; }
YY_BREAK
case 22:
YY_RULE_SETUP
#line 214 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return UNDEF; }
YY_BREAK
case 23:
YY_RULE_SETUP
#line 215 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return NULL_TOK; }
YY_BREAK
case 24:
YY_RULE_SETUP
#line 216 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return TO; }
YY_BREAK
case 25:
YY_RULE_SETUP
#line 217 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return TAIL; }
YY_BREAK
case 26:
YY_RULE_SETUP
#line 218 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return TARGET; }
YY_BREAK
case 27:
YY_RULE_SETUP
#line 219 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return TRIPLE; }
YY_BREAK
case 28:
YY_RULE_SETUP
#line 220 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return DEPLIBS; }
YY_BREAK
case 29:
YY_RULE_SETUP
#line 221 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return DATALAYOUT; }
YY_BREAK
case 30:
YY_RULE_SETUP
#line 222 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return VOLATILE; }
YY_BREAK
case 31:
YY_RULE_SETUP
#line 223 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return ALIGN; }
YY_BREAK
case 32:
YY_RULE_SETUP
#line 224 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return SECTION; }
YY_BREAK
case 33:
YY_RULE_SETUP
#line 225 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return MODULE; }
YY_BREAK
case 34:
YY_RULE_SETUP
#line 226 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return ASM_TOK; }
YY_BREAK
case 35:
YY_RULE_SETUP
#line 227 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return SIDEEFFECT; }
YY_BREAK
case 36:
YY_RULE_SETUP
#line 229 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return CC_TOK; }
YY_BREAK
case 37:
YY_RULE_SETUP
#line 230 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return CCC_TOK; }
YY_BREAK
case 38:
YY_RULE_SETUP
#line 231 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return FASTCC_TOK; }
YY_BREAK
case 39:
YY_RULE_SETUP
#line 232 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return COLDCC_TOK; }
YY_BREAK
case 40:
YY_RULE_SETUP
#line 233 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return X86_STDCALLCC_TOK; }
YY_BREAK
case 41:
YY_RULE_SETUP
#line 234 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return X86_FASTCALLCC_TOK; }
YY_BREAK
case 42:
YY_RULE_SETUP
#line 236 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return INREG; }
YY_BREAK
case 43:
YY_RULE_SETUP
#line 237 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return SRET; }
YY_BREAK
case 44:
YY_RULE_SETUP
#line 238 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return NOUNWIND; }
YY_BREAK
case 45:
YY_RULE_SETUP
#line 239 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return NORETURN; }
YY_BREAK
case 46:
YY_RULE_SETUP
#line 241 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TY(Type::VoidTy, VOID); }
YY_BREAK
case 47:
YY_RULE_SETUP
#line 242 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TY(Type::FloatTy, FLOAT); }
YY_BREAK
case 48:
YY_RULE_SETUP
#line 243 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TY(Type::DoubleTy,DOUBLE);}
YY_BREAK
case 49:
YY_RULE_SETUP
#line 244 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TY(Type::LabelTy, LABEL); }
YY_BREAK
case 50:
YY_RULE_SETUP
#line 245 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return TYPE; }
YY_BREAK
case 51:
YY_RULE_SETUP
#line 246 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return OPAQUE; }
YY_BREAK
case 52:
YY_RULE_SETUP
#line 247 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ uint64_t NumBits = atoull(llvmAsmtext+1);
if (NumBits < IntegerType::MIN_INT_BITS ||
NumBits > IntegerType::MAX_INT_BITS)
GenerateError("Bitwidth for integer type out of range!");
const Type* Ty = IntegerType::get(NumBits);
RET_TY(Ty, INTTYPE);
}
YY_BREAK
case 53:
YY_RULE_SETUP
#line 255 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, Add, ADD); }
YY_BREAK
case 54:
YY_RULE_SETUP
#line 256 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, Sub, SUB); }
YY_BREAK
case 55:
YY_RULE_SETUP
#line 257 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, Mul, MUL); }
YY_BREAK
case 56:
YY_RULE_SETUP
#line 258 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, UDiv, UDIV); }
YY_BREAK
case 57:
YY_RULE_SETUP
#line 259 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, SDiv, SDIV); }
YY_BREAK
case 58:
YY_RULE_SETUP
#line 260 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, FDiv, FDIV); }
YY_BREAK
case 59:
YY_RULE_SETUP
#line 261 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, URem, UREM); }
YY_BREAK
case 60:
YY_RULE_SETUP
#line 262 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, SRem, SREM); }
YY_BREAK
case 61:
YY_RULE_SETUP
#line 263 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, FRem, FREM); }
YY_BREAK
case 62:
YY_RULE_SETUP
#line 264 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, Shl, SHL); }
YY_BREAK
case 63:
YY_RULE_SETUP
#line 265 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, LShr, LSHR); }
YY_BREAK
case 64:
YY_RULE_SETUP
#line 266 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, AShr, ASHR); }
YY_BREAK
case 65:
YY_RULE_SETUP
#line 267 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, And, AND); }
YY_BREAK
case 66:
YY_RULE_SETUP
#line 268 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, Or , OR ); }
YY_BREAK
case 67:
YY_RULE_SETUP
#line 269 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(BinaryOpVal, Xor, XOR); }
YY_BREAK
case 68:
YY_RULE_SETUP
#line 270 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, ICmp, ICMP); }
YY_BREAK
case 69:
YY_RULE_SETUP
#line 271 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, FCmp, FCMP); }
YY_BREAK
case 70:
YY_RULE_SETUP
#line 273 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return EQ; }
YY_BREAK
case 71:
YY_RULE_SETUP
#line 274 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return NE; }
YY_BREAK
case 72:
YY_RULE_SETUP
#line 275 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return SLT; }
YY_BREAK
case 73:
YY_RULE_SETUP
#line 276 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return SGT; }
YY_BREAK
case 74:
YY_RULE_SETUP
#line 277 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return SLE; }
YY_BREAK
case 75:
YY_RULE_SETUP
#line 278 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return SGE; }
YY_BREAK
case 76:
YY_RULE_SETUP
#line 279 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return ULT; }
YY_BREAK
case 77:
YY_RULE_SETUP
#line 280 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return UGT; }
YY_BREAK
case 78:
YY_RULE_SETUP
#line 281 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return ULE; }
YY_BREAK
case 79:
YY_RULE_SETUP
#line 282 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return UGE; }
YY_BREAK
case 80:
YY_RULE_SETUP
#line 283 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return OEQ; }
YY_BREAK
case 81:
YY_RULE_SETUP
#line 284 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return ONE; }
YY_BREAK
case 82:
YY_RULE_SETUP
#line 285 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return OLT; }
YY_BREAK
case 83:
YY_RULE_SETUP
#line 286 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return OGT; }
YY_BREAK
case 84:
YY_RULE_SETUP
#line 287 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return OLE; }
YY_BREAK
case 85:
YY_RULE_SETUP
#line 288 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return OGE; }
YY_BREAK
case 86:
YY_RULE_SETUP
#line 289 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return ORD; }
YY_BREAK
case 87:
YY_RULE_SETUP
#line 290 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return UNO; }
YY_BREAK
case 88:
YY_RULE_SETUP
#line 291 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return UEQ; }
YY_BREAK
case 89:
YY_RULE_SETUP
#line 292 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return UNE; }
YY_BREAK
case 90:
YY_RULE_SETUP
#line 294 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, PHI, PHI_TOK); }
YY_BREAK
case 91:
YY_RULE_SETUP
#line 295 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, Call, CALL); }
YY_BREAK
case 92:
YY_RULE_SETUP
#line 296 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(CastOpVal, Trunc, TRUNC); }
YY_BREAK
case 93:
YY_RULE_SETUP
#line 297 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(CastOpVal, ZExt, ZEXT); }
YY_BREAK
case 94:
YY_RULE_SETUP
#line 298 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(CastOpVal, SExt, SEXT); }
YY_BREAK
case 95:
YY_RULE_SETUP
#line 299 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(CastOpVal, FPTrunc, FPTRUNC); }
YY_BREAK
case 96:
YY_RULE_SETUP
#line 300 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(CastOpVal, FPExt, FPEXT); }
YY_BREAK
case 97:
YY_RULE_SETUP
#line 301 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(CastOpVal, UIToFP, UITOFP); }
YY_BREAK
case 98:
YY_RULE_SETUP
#line 302 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(CastOpVal, SIToFP, SITOFP); }
YY_BREAK
case 99:
YY_RULE_SETUP
#line 303 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(CastOpVal, FPToUI, FPTOUI); }
YY_BREAK
case 100:
YY_RULE_SETUP
#line 304 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(CastOpVal, FPToSI, FPTOSI); }
YY_BREAK
case 101:
YY_RULE_SETUP
#line 305 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(CastOpVal, IntToPtr, INTTOPTR); }
YY_BREAK
case 102:
YY_RULE_SETUP
#line 306 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(CastOpVal, PtrToInt, PTRTOINT); }
YY_BREAK
case 103:
YY_RULE_SETUP
#line 307 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(CastOpVal, BitCast, BITCAST); }
YY_BREAK
case 104:
YY_RULE_SETUP
#line 308 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, Select, SELECT); }
YY_BREAK
case 105:
YY_RULE_SETUP
#line 309 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, VAArg , VAARG); }
YY_BREAK
case 106:
YY_RULE_SETUP
#line 310 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(TermOpVal, Ret, RET); }
YY_BREAK
case 107:
YY_RULE_SETUP
#line 311 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(TermOpVal, Br, BR); }
YY_BREAK
case 108:
YY_RULE_SETUP
#line 312 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(TermOpVal, Switch, SWITCH); }
YY_BREAK
case 109:
YY_RULE_SETUP
#line 313 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(TermOpVal, Invoke, INVOKE); }
YY_BREAK
case 110:
YY_RULE_SETUP
#line 314 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(TermOpVal, Unwind, UNWIND); }
YY_BREAK
case 111:
YY_RULE_SETUP
#line 315 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(TermOpVal, Unreachable, UNREACHABLE); }
YY_BREAK
case 112:
YY_RULE_SETUP
#line 317 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(MemOpVal, Malloc, MALLOC); }
YY_BREAK
case 113:
YY_RULE_SETUP
#line 318 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(MemOpVal, Alloca, ALLOCA); }
YY_BREAK
case 114:
YY_RULE_SETUP
#line 319 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(MemOpVal, Free, FREE); }
YY_BREAK
case 115:
YY_RULE_SETUP
#line 320 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(MemOpVal, Load, LOAD); }
YY_BREAK
case 116:
YY_RULE_SETUP
#line 321 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(MemOpVal, Store, STORE); }
YY_BREAK
case 117:
YY_RULE_SETUP
#line 322 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(MemOpVal, GetElementPtr, GETELEMENTPTR); }
YY_BREAK
case 118:
YY_RULE_SETUP
#line 324 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, ExtractElement, EXTRACTELEMENT); }
YY_BREAK
case 119:
YY_RULE_SETUP
#line 325 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, InsertElement, INSERTELEMENT); }
YY_BREAK
case 120:
YY_RULE_SETUP
#line 326 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ RET_TOK(OtherOpVal, ShuffleVector, SHUFFLEVECTOR); }
YY_BREAK
case 121:
YY_RULE_SETUP
#line 329 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{
UnEscapeLexed(llvmAsmtext+1);
llvmAsmlval.StrVal = strdup(llvmAsmtext+1); // Skip %
return LOCALVAR;
}
YY_BREAK
case 122:
YY_RULE_SETUP
#line 334 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{
UnEscapeLexed(llvmAsmtext+1);
llvmAsmlval.StrVal = strdup(llvmAsmtext+1); // Skip @
return GLOBALVAR;
}
YY_BREAK
case 123:
YY_RULE_SETUP
#line 339 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{
llvmAsmtext[strlen(llvmAsmtext)-1] = 0; // nuke colon
UnEscapeLexed(llvmAsmtext);
llvmAsmlval.StrVal = strdup(llvmAsmtext);
return LABELSTR;
}
YY_BREAK
case 124:
/* rule 124 can match eol */
YY_RULE_SETUP
#line 345 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{
llvmAsmtext[strlen(llvmAsmtext)-2] = 0; // nuke colon, end quote
UnEscapeLexed(llvmAsmtext+1);
llvmAsmlval.StrVal = strdup(llvmAsmtext+1);
return LABELSTR;
}
YY_BREAK
case 125:
/* rule 125 can match eol */
YY_RULE_SETUP
#line 352 "/home/laurov/llvm/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.
//
llvmAsmtext[strlen(llvmAsmtext)-1] = 0; // nuke end quote
llvmAsmlval.StrVal = strdup(llvmAsmtext+1); // Nuke start quote
return STRINGCONSTANT;
}
YY_BREAK
case 126:
/* rule 126 can match eol */
YY_RULE_SETUP
#line 361 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{
llvmAsmtext[strlen(llvmAsmtext)-1] = 0; // nuke end quote
llvmAsmlval.StrVal = strdup(llvmAsmtext+2); // Nuke @, quote
return ATSTRINGCONSTANT;
}
YY_BREAK
case 127:
YY_RULE_SETUP
#line 367 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ int len = strlen(llvmAsmtext);
uint32_t numBits = ((len * 64) / 19) + 1;
APInt Tmp(numBits, llvmAsmtext, len, 10);
uint32_t activeBits = Tmp.getActiveBits();
if (activeBits > 0 && activeBits < numBits)
Tmp.trunc(activeBits);
if (Tmp.getBitWidth() > 64) {
llvmAsmlval.APIntVal = new APInt(Tmp);
return EUAPINTVAL;
} else {
llvmAsmlval.UInt64Val = Tmp.getZExtValue();
return EUINT64VAL;
}
}
YY_BREAK
case 128:
YY_RULE_SETUP
#line 381 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ int len = strlen(llvmAsmtext);
uint32_t numBits = (((len-1) * 64) / 19) + 2;
APInt Tmp(numBits, llvmAsmtext, len, 10);
uint32_t minBits = Tmp.getMinSignedBits();
if (minBits > 0 && minBits < numBits)
Tmp.trunc(minBits);
if (Tmp.getBitWidth() > 64) {
llvmAsmlval.APIntVal = new APInt(Tmp);
return ESAPINTVAL;
} else {
llvmAsmlval.SInt64Val = Tmp.getSExtValue();
return ESINT64VAL;
}
}
YY_BREAK
case 129:
YY_RULE_SETUP
#line 396 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ int len = strlen(llvmAsmtext+3) - 3;
uint32_t bits = len * 4;
APInt Tmp(bits, llvmAsmtext+3, len, 16);
uint32_t activeBits = Tmp.getActiveBits();
if (activeBits > 0 && activeBits < bits)
Tmp.trunc(activeBits);
if (Tmp.getBitWidth() > 64) {
llvmAsmlval.APIntVal = new APInt(Tmp);
return llvmAsmtext[0] == 's' ? ESAPINTVAL : EUAPINTVAL;
} else if (llvmAsmtext[0] == 's') {
llvmAsmlval.SInt64Val = Tmp.getSExtValue();
return ESINT64VAL;
} else {
llvmAsmlval.UInt64Val = Tmp.getZExtValue();
return EUINT64VAL;
}
}
YY_BREAK
case 130:
YY_RULE_SETUP
#line 414 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{
uint64_t Val = atoull(llvmAsmtext+1);
if ((unsigned)Val != Val)
GenerateError("Invalid value number (too large)!");
llvmAsmlval.UIntVal = unsigned(Val);
return LOCALVAL_ID;
}
YY_BREAK
case 131:
YY_RULE_SETUP
#line 421 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{
uint64_t Val = atoull(llvmAsmtext+1);
if ((unsigned)Val != Val)
GenerateError("Invalid value number (too large)!");
llvmAsmlval.UIntVal = unsigned(Val);
return GLOBALVAL_ID;
}
YY_BREAK
case 132:
YY_RULE_SETUP
#line 429 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.FPVal = atof(llvmAsmtext); return FPVAL; }
YY_BREAK
case 133:
YY_RULE_SETUP
#line 430 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ llvmAsmlval.FPVal = HexToFP(llvmAsmtext); return FPVAL; }
YY_BREAK
case YY_STATE_EOF(INITIAL):
#line 432 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{
/* Make sure to free the internal buffers for flex when we are
* done reading our input!
*/
llvmAsm_delete_buffer(YY_CURRENT_BUFFER);
return EOF;
}
YY_BREAK
case 134:
/* rule 134 can match eol */
YY_RULE_SETUP
#line 440 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ /* Ignore whitespace */ }
YY_BREAK
case 135:
YY_RULE_SETUP
#line 441 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
{ return llvmAsmtext[0]; }
YY_BREAK
case 136:
YY_RULE_SETUP
#line 443 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
YY_FATAL_ERROR( "flex scanner jammed" );
YY_BREAK
#line 2110 "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_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
{
/* We're scanning a new file or input source. It's
* possible that this happened because the user
* just pointed llvmAsmin at a new source and called
* llvmAsmlex(). If so, then we have to assure
* consistency between YY_CURRENT_BUFFER and our
* globals. Here is the right place to do so, because
* this is the first action (other than possibly a
* back-up) that will match for the new input source.
*/
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
YY_CURRENT_BUFFER_LVALUE->yy_input_file = llvmAsmin;
YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
}
/* Note that here we test for yy_c_buf_p "<=" to the position
* of the first EOB in the buffer, since yy_c_buf_p will
* already have been incremented past the NUL character
* (since all states make transitions on EOB to the
* end-of-buffer state). Contrast this with the test
* in input().
*/
if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
{ /* This was really a NUL. */
yy_state_type yy_next_state;
(yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state( );
/* Okay, we're now positioned to make the NUL
* transition. We couldn't have
* yy_get_previous_state() go ahead and do it
* for us because it doesn't know how to deal
* with the possibility of jamming (and we don't
* want to build jamming into it because then it
* will run more slowly).
*/
yy_next_state = yy_try_NUL_trans( yy_current_state );
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
if ( yy_next_state )
{
/* Consume the NUL. */
yy_cp = ++(yy_c_buf_p);
yy_current_state = yy_next_state;
goto yy_match;
}
else
{
yy_cp = (yy_last_accepting_cpos);
yy_current_state = (yy_last_accepting_state);
goto yy_find_action;
}
}
else switch ( yy_get_next_buffer( ) )
{
case EOB_ACT_END_OF_FILE:
{
(yy_did_buffer_switch_on_eof) = 0;
if ( llvmAsmwrap( ) )
{
/* Note: because we've taken care in
* yy_get_next_buffer() to have set up
* llvmAsmtext, we can now set up
* yy_c_buf_p so that if some total
* hoser (like flex itself) wants to
* call the scanner after we return the
* YY_NULL, it'll still work - another
* YY_NULL will get returned.
*/
(yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;
yy_act = YY_STATE_EOF(YY_START);
goto do_action;
}
else
{
if ( ! (yy_did_buffer_switch_on_eof) )
YY_NEW_FILE;
}
break;
}
case EOB_ACT_CONTINUE_SCAN:
(yy_c_buf_p) =
(yytext_ptr) + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state( );
yy_cp = (yy_c_buf_p);
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
goto yy_match;
case EOB_ACT_LAST_MATCH:
(yy_c_buf_p) =
&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)];
yy_current_state = yy_get_previous_state( );
yy_cp = (yy_c_buf_p);
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
goto yy_find_action;
}
break;
}
default:
YY_FATAL_ERROR(
"fatal flex scanner internal error--no action found" );
} /* end of action switch */
} /* end of scanning one token */
} /* end of llvmAsmlex */
/* yy_get_next_buffer - try to read in a new buffer
*
* Returns a code representing an action:
* EOB_ACT_LAST_MATCH -
* EOB_ACT_CONTINUE_SCAN - continue scanning from current position
* EOB_ACT_END_OF_FILE - end of file
*/
static int yy_get_next_buffer (void)
{
register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
register char *source = (yytext_ptr);
register int number_to_move, i;
int ret_val;
if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
YY_FATAL_ERROR(
"fatal flex scanner internal error--end of buffer missed" );
if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
{ /* Don't try to fill the buffer, so this is an EOF. */
if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 )
{
/* We matched a single character, the EOB, so
* treat this as a final EOF.
*/
return EOB_ACT_END_OF_FILE;
}
else
{
/* We matched some text prior to the EOB, first
* process it.
*/
return EOB_ACT_LAST_MATCH;
}
}
/* Try to read more data. */
/* First move last chars to start of buffer. */
number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1;
for ( i = 0; i < number_to_move; ++i )
*(dest++) = *(source++);
if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
/* don't do the read, it's not guaranteed to return an EOF,
* just force an EOF
*/
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0;
else
{
int num_to_read =
YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
while ( num_to_read <= 0 )
{ /* Not enough room in the buffer - grow it. */
/* just a shorter name for the current buffer */
YY_BUFFER_STATE b = YY_CURRENT_BUFFER;
int yy_c_buf_p_offset =
(int) ((yy_c_buf_p) - b->yy_ch_buf);
if ( b->yy_is_our_buffer )
{
int new_size = b->yy_buf_size * 2;
if ( new_size <= 0 )
b->yy_buf_size += b->yy_buf_size / 8;
else
b->yy_buf_size *= 2;
b->yy_ch_buf = (char *)
/* Include room in for 2 EOB chars. */
llvmAsmrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 );
}
else
/* Can't grow it, we don't own it. */
b->yy_ch_buf = 0;
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR(
"fatal error - scanner input buffer overflow" );
(yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset];
num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
number_to_move - 1;
}
if ( num_to_read > YY_READ_BUF_SIZE )
num_to_read = YY_READ_BUF_SIZE;
/* Read in more data. */
YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
(yy_n_chars), num_to_read );
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
if ( (yy_n_chars) == 0 )
{
if ( number_to_move == YY_MORE_ADJ )
{
ret_val = EOB_ACT_END_OF_FILE;
llvmAsmrestart(llvmAsmin );
}
else
{
ret_val = EOB_ACT_LAST_MATCH;
YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
YY_BUFFER_EOF_PENDING;
}
}
else
ret_val = EOB_ACT_CONTINUE_SCAN;
(yy_n_chars) += number_to_move;
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR;
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR;
(yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
return ret_val;
}
/* yy_get_previous_state - get the state just before the EOB char was reached */
static yy_state_type yy_get_previous_state (void)
{
register yy_state_type yy_current_state;
register char *yy_cp;
yy_current_state = (yy_start);
for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
{
register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 550 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
}
return yy_current_state;
}
/* yy_try_NUL_trans - try to make a transition on the NUL character
*
* synopsis
* next_state = yy_try_NUL_trans( current_state );
*/
static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state )
{
register int yy_is_jam;
register char *yy_cp = (yy_c_buf_p);
register YY_CHAR yy_c = 1;
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 550 )
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 == 549);
return yy_is_jam ? 0 : yy_current_state;
}
static inline void yyunput (int c, register char * yy_bp )
{
register char *yy_cp;
yy_cp = (yy_c_buf_p);
/* undo effects of setting up llvmAsmtext */
*yy_cp = (yy_hold_char);
if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
{ /* need to shift things up to make room */
/* +2 for EOB chars. */
register int number_to_move = (yy_n_chars) + 2;
register char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[
YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2];
register char *source =
&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move];
while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
*--dest = *--source;
yy_cp += (int) (dest - source);
yy_bp += (int) (dest - source);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars =
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_buf_size;
if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
YY_FATAL_ERROR( "flex scanner push-back overflow" );
}
*--yy_cp = (char) c;
if ( c == '\n' ){
--llvmAsmlineno;
}
(yytext_ptr) = yy_bp;
(yy_hold_char) = *yy_cp;
(yy_c_buf_p) = yy_cp;
}
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (void)
#else
static int input (void)
#endif
{
int c;
*(yy_c_buf_p) = (yy_hold_char);
if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR )
{
/* yy_c_buf_p now points to the character we want to return.
* If this occurs *before* the EOB characters, then it's a
* valid NUL; if not, then we've hit the end of the buffer.
*/
if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
/* This was really a NUL. */
*(yy_c_buf_p) = '\0';
else
{ /* need more input */
int offset = (yy_c_buf_p) - (yytext_ptr);
++(yy_c_buf_p);
switch ( yy_get_next_buffer( ) )
{
case EOB_ACT_LAST_MATCH:
/* This happens because yy_g_n_b()
* sees that we've accumulated a
* token and flags that we need to
* try matching the token before
* proceeding. But for input(),
* there's no matching to consider.
* So convert the EOB_ACT_LAST_MATCH
* to EOB_ACT_END_OF_FILE.
*/
/* Reset buffer status. */
llvmAsmrestart(llvmAsmin );
/*FALLTHROUGH*/
case EOB_ACT_END_OF_FILE:
{
if ( llvmAsmwrap( ) )
return EOF;
if ( ! (yy_did_buffer_switch_on_eof) )
YY_NEW_FILE;
#ifdef __cplusplus
return yyinput();
#else
return input();
#endif
}
case EOB_ACT_CONTINUE_SCAN:
(yy_c_buf_p) = (yytext_ptr) + offset;
break;
}
}
}
c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */
*(yy_c_buf_p) = '\0'; /* preserve llvmAsmtext */
(yy_hold_char) = *++(yy_c_buf_p);
if ( c == '\n' )
llvmAsmlineno++;
;
return c;
}
#endif /* ifndef YY_NO_INPUT */
/** Immediately switch to a different input stream.
* @param input_file A readable stream.
*
* @note This function does not reset the start condition to @c INITIAL .
*/
void llvmAsmrestart (FILE * input_file )
{
if ( ! YY_CURRENT_BUFFER ){
llvmAsmensure_buffer_stack ();
YY_CURRENT_BUFFER_LVALUE =
llvmAsm_create_buffer(llvmAsmin,YY_BUF_SIZE );
}
llvmAsm_init_buffer(YY_CURRENT_BUFFER,input_file );
llvmAsm_load_buffer_state( );
}
/** Switch to a different input buffer.
* @param new_buffer The new input buffer.
*
*/
void llvmAsm_switch_to_buffer (YY_BUFFER_STATE new_buffer )
{
/* TODO. We should be able to replace this entire function body
* with
* llvmAsmpop_buffer_state();
* llvmAsmpush_buffer_state(new_buffer);
*/
llvmAsmensure_buffer_stack ();
if ( YY_CURRENT_BUFFER == new_buffer )
return;
if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
*(yy_c_buf_p) = (yy_hold_char);
YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
YY_CURRENT_BUFFER_LVALUE = new_buffer;
llvmAsm_load_buffer_state( );
/* We don't actually know whether we did this switch during
* EOF (llvmAsmwrap()) processing, but the only time this flag
* is looked at is after llvmAsmwrap() is called, so it's safe
* to go ahead and always set it.
*/
(yy_did_buffer_switch_on_eof) = 1;
}
static void llvmAsm_load_buffer_state (void)
{
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
(yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
llvmAsmin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
(yy_hold_char) = *(yy_c_buf_p);
}
/** Allocate and initialize an input buffer state.
* @param file A readable stream.
* @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
*
* @return the allocated buffer state.
*/
YY_BUFFER_STATE llvmAsm_create_buffer (FILE * file, int size )
{
YY_BUFFER_STATE b;
b = (YY_BUFFER_STATE) llvmAsmalloc(sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in llvmAsm_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 *) llvmAsmalloc(b->yy_buf_size + 2 );
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in llvmAsm_create_buffer()" );
b->yy_is_our_buffer = 1;
llvmAsm_init_buffer(b,file );
return b;
}
/** Destroy the buffer.
* @param b a buffer created with llvmAsm_create_buffer()
*
*/
void llvmAsm_delete_buffer (YY_BUFFER_STATE b )
{
if ( ! b )
return;
if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
if ( b->yy_is_our_buffer )
llvmAsmfree((void *) b->yy_ch_buf );
llvmAsmfree((void *) b );
}
/* Initializes or reinitializes a buffer.
* This function is sometimes called more than once on the same buffer,
* such as during a llvmAsmrestart() or at EOF.
*/
static void llvmAsm_init_buffer (YY_BUFFER_STATE b, FILE * file )
{
int oerrno = errno;
llvmAsm_flush_buffer(b );
b->yy_input_file = file;
b->yy_fill_buffer = 1;
/* If b is the current buffer, then llvmAsm_init_buffer was _probably_
* called from llvmAsmrestart() or through yy_get_next_buffer.
* In that case, we don't want to reset the lineno or column.
*/
if (b != YY_CURRENT_BUFFER){
b->yy_bs_lineno = 1;
b->yy_bs_column = 0;
}
b->yy_is_interactive = 0;
errno = oerrno;
}
/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
* @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
*
*/
void llvmAsm_flush_buffer (YY_BUFFER_STATE b )
{
if ( ! b )
return;
b->yy_n_chars = 0;
/* We always need two end-of-buffer characters. The first causes
* a transition to the end-of-buffer state. The second causes
* a jam in that state.
*/
b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
b->yy_buf_pos = &b->yy_ch_buf[0];
b->yy_at_bol = 1;
b->yy_buffer_status = YY_BUFFER_NEW;
if ( b == YY_CURRENT_BUFFER )
llvmAsm_load_buffer_state( );
}
/** Pushes the new state onto the stack. The new state becomes
* the current state. This function will allocate the stack
* if necessary.
* @param new_buffer The new state.
*
*/
void llvmAsmpush_buffer_state (YY_BUFFER_STATE new_buffer )
{
if (new_buffer == NULL)
return;
llvmAsmensure_buffer_stack();
/* This block is copied from llvmAsm_switch_to_buffer. */
if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
*(yy_c_buf_p) = (yy_hold_char);
YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
/* Only push if top exists. Otherwise, replace top. */
if (YY_CURRENT_BUFFER)
(yy_buffer_stack_top)++;
YY_CURRENT_BUFFER_LVALUE = new_buffer;
/* copied from llvmAsm_switch_to_buffer. */
llvmAsm_load_buffer_state( );
(yy_did_buffer_switch_on_eof) = 1;
}
/** Removes and deletes the top of the stack, if present.
* The next element becomes the new top.
*
*/
void llvmAsmpop_buffer_state (void)
{
if (!YY_CURRENT_BUFFER)
return;
llvmAsm_delete_buffer(YY_CURRENT_BUFFER );
YY_CURRENT_BUFFER_LVALUE = NULL;
if ((yy_buffer_stack_top) > 0)
--(yy_buffer_stack_top);
if (YY_CURRENT_BUFFER) {
llvmAsm_load_buffer_state( );
(yy_did_buffer_switch_on_eof) = 1;
}
}
/* Allocates the stack if it does not exist.
* Guarantees space for at least one push.
*/
static void llvmAsmensure_buffer_stack (void)
{
int num_to_alloc;
if (!(yy_buffer_stack)) {
/* First allocation is just for 2 elements, since we don't know if this
* scanner will even need a stack. We use 2 instead of 1 to avoid an
* immediate realloc on the next call.
*/
num_to_alloc = 1;
(yy_buffer_stack) = (struct yy_buffer_state**)llvmAsmalloc
(num_to_alloc * sizeof(struct yy_buffer_state*)
);
memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*));
(yy_buffer_stack_max) = num_to_alloc;
(yy_buffer_stack_top) = 0;
return;
}
if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){
/* Increase the buffer to prepare for a possible push. */
int grow_size = 8 /* arbitrary grow size */;
num_to_alloc = (yy_buffer_stack_max) + grow_size;
(yy_buffer_stack) = (struct yy_buffer_state**)llvmAsmrealloc
((yy_buffer_stack),
num_to_alloc * sizeof(struct yy_buffer_state*)
);
/* zero only the new slots.*/
memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*));
(yy_buffer_stack_max) = num_to_alloc;
}
}
/** Setup the input buffer state to scan directly from a user-specified character buffer.
* @param base the character buffer
* @param size the size in bytes of the character buffer
*
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE llvmAsm_scan_buffer (char * base, yy_size_t size )
{
YY_BUFFER_STATE b;
if ( size < 2 ||
base[size-2] != YY_END_OF_BUFFER_CHAR ||
base[size-1] != YY_END_OF_BUFFER_CHAR )
/* They forgot to leave room for the EOB's. */
return 0;
b = (YY_BUFFER_STATE) llvmAsmalloc(sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in llvmAsm_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;
llvmAsm_switch_to_buffer(b );
return b;
}
/** Setup the input buffer state to scan a string. The next call to llvmAsmlex() will
* scan from a @e copy of @a str.
* @param yystr a NUL-terminated string to scan
*
* @return the newly allocated buffer state object.
* @note If you want to scan bytes that may contain NUL values, then use
* llvmAsm_scan_bytes() instead.
*/
YY_BUFFER_STATE llvmAsm_scan_string (yyconst char * yystr )
{
return llvmAsm_scan_bytes(yystr,strlen(yystr) );
}
/** Setup the input buffer state to scan the given bytes. The next call to llvmAsmlex() will
* scan from a @e copy of @a bytes.
* @param bytes the byte buffer to scan
* @param len the number of bytes in the buffer pointed to by @a bytes.
*
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE llvmAsm_scan_bytes (yyconst char * yybytes, int _yybytes_len )
{
YY_BUFFER_STATE b;
char *buf;
yy_size_t n;
int i;
/* Get memory for full buffer, including space for trailing EOB's. */
n = _yybytes_len + 2;
buf = (char *) llvmAsmalloc(n );
if ( ! buf )
YY_FATAL_ERROR( "out of dynamic memory in llvmAsm_scan_bytes()" );
for ( i = 0; i < _yybytes_len; ++i )
buf[i] = yybytes[i];
buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
b = llvmAsm_scan_buffer(buf,n );
if ( ! b )
YY_FATAL_ERROR( "bad buffer in llvmAsm_scan_bytes()" );
/* It's okay to grow etc. this buffer, and we should throw it
* away when we're done.
*/
b->yy_is_our_buffer = 1;
return b;
}
#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif
static void yy_fatal_error (yyconst char* msg )
{
(void) fprintf( stderr, "%s\n", msg );
exit( YY_EXIT_FAILURE );
}
/* Redefine yyless() so it works in section 3 code. */
#undef yyless
#define yyless(n) \
do \
{ \
/* Undo effects of setting up llvmAsmtext. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
llvmAsmtext[llvmAsmleng] = (yy_hold_char); \
(yy_c_buf_p) = llvmAsmtext + yyless_macro_arg; \
(yy_hold_char) = *(yy_c_buf_p); \
*(yy_c_buf_p) = '\0'; \
llvmAsmleng = yyless_macro_arg; \
} \
while ( 0 )
/* Accessor methods (get/set functions) to struct members. */
/** Get the current line number.
*
*/
int llvmAsmget_lineno (void)
{
return llvmAsmlineno;
}
/** Get the input stream.
*
*/
FILE *llvmAsmget_in (void)
{
return llvmAsmin;
}
/** Get the output stream.
*
*/
FILE *llvmAsmget_out (void)
{
return llvmAsmout;
}
/** Get the length of the current token.
*
*/
int llvmAsmget_leng (void)
{
return llvmAsmleng;
}
/** Get the current token.
*
*/
char *llvmAsmget_text (void)
{
return llvmAsmtext;
}
/** Set the current line number.
* @param line_number
*
*/
void llvmAsmset_lineno (int line_number )
{
llvmAsmlineno = line_number;
}
/** Set the input stream. This does not discard the current
* input buffer.
* @param in_str A readable stream.
*
* @see llvmAsm_switch_to_buffer
*/
void llvmAsmset_in (FILE * in_str )
{
llvmAsmin = in_str ;
}
void llvmAsmset_out (FILE * out_str )
{
llvmAsmout = out_str ;
}
int llvmAsmget_debug (void)
{
return llvmAsm_flex_debug;
}
void llvmAsmset_debug (int bdebug )
{
llvmAsm_flex_debug = bdebug ;
}
static int yy_init_globals (void)
{
/* Initialization is the same as for the non-reentrant scanner.
* This function is called from llvmAsmlex_destroy(), so don't allocate here.
*/
/* We do not touch llvmAsmlineno unless the option is enabled. */
llvmAsmlineno = 1;
(yy_buffer_stack) = 0;
(yy_buffer_stack_top) = 0;
(yy_buffer_stack_max) = 0;
(yy_c_buf_p) = (char *) 0;
(yy_init) = 0;
(yy_start) = 0;
/* Defined in main.c */
#ifdef YY_STDINIT
llvmAsmin = stdin;
llvmAsmout = stdout;
#else
llvmAsmin = (FILE *) 0;
llvmAsmout = (FILE *) 0;
#endif
/* For future reference: Set errno on error, since we are called by
* llvmAsmlex_init()
*/
return 0;
}
/* llvmAsmlex_destroy is for both reentrant and non-reentrant scanners. */
int llvmAsmlex_destroy (void)
{
/* Pop the buffer stack, destroying each element. */
while(YY_CURRENT_BUFFER){
llvmAsm_delete_buffer(YY_CURRENT_BUFFER );
YY_CURRENT_BUFFER_LVALUE = NULL;
llvmAsmpop_buffer_state();
}
/* Destroy the stack itself. */
llvmAsmfree((yy_buffer_stack) );
(yy_buffer_stack) = NULL;
/* Reset the globals. This is important in a non-reentrant scanner so the next time
* llvmAsmlex() is called, initialization will occur. */
yy_init_globals( );
return 0;
}
/*
* Internal utility routines.
*/
#ifndef yytext_ptr
static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
{
register int i;
for ( i = 0; i < n; ++i )
s1[i] = s2[i];
}
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * s )
{
register int n;
for ( n = 0; s[n]; ++n )
;
return n;
}
#endif
void *llvmAsmalloc (yy_size_t size )
{
return (void *) malloc( size );
}
void *llvmAsmrealloc (void * ptr, yy_size_t size )
{
/* The cast to (char *) in the following accommodates both
* implementations that use char* generic pointers, and those
* that use void* generic pointers. It works with the latter
* because both ANSI C and C++ allow castless assignment from
* any pointer type to void*, and deal with argument conversions
* as though doing an assignment.
*/
return (void *) realloc( (char *) ptr, size );
}
void llvmAsmfree (void * ptr )
{
free( (char *) ptr ); /* see llvmAsmrealloc() for (char *) cast */
}
#define YYTABLES_NAME "yytables"
#line 443 "/home/laurov/llvm/llvm/lib/AsmParser/Lexer.l"
Reference in New Issue View Git Blame Copy Permalink