[llvm-commits] CVS: llvm/lib/AsmParser/Lexer.cpp.cvs Lexer.l.cvs Lexer.cpp
Chris Lattner
lattner at cs.uiuc.edu
Mon Feb 13 21:14:58 PST 2006
Changes in directory llvm/lib/AsmParser:
Lexer.cpp.cvs added (r1.1)
Lexer.l.cvs added (r1.1)
Lexer.cpp (r1.18) removed
---
Log message:
adjust to new style of handling lexer changes
---
Diffs of the changes: (+2980 -0)
Lexer.cpp.cvs | 2625 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Lexer.l.cvs | 355 +++++++
2 files changed, 2980 insertions(+)
Index: llvm/lib/AsmParser/Lexer.cpp.cvs
diff -c /dev/null llvm/lib/AsmParser/Lexer.cpp.cvs:1.1
*** /dev/null Mon Feb 13 23:14:56 2006
--- llvm/lib/AsmParser/Lexer.cpp.cvs Mon Feb 13 23:14:46 2006
***************
*** 0 ****
--- 1,2625 ----
+ #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: /home/vadve/shared/PublicCVS/llvm/lib/AsmParser/Lexer.cpp.cvs,v 1.1 2006/02/14 05:14:46 lattner Exp $
+ */
+
+ #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 106
+ #define YY_END_OF_BUFFER 107
+ static yyconst short int yy_acclist[184] =
+ { 0,
+ 107, 105, 106, 104, 105, 106, 104, 106, 105, 106,
+ 105, 106, 105, 106, 105, 106, 105, 106, 105, 106,
+ 97, 105, 106, 97, 105, 106, 1, 105, 106, 105,
+ 106, 105, 106, 105, 106, 105, 106, 105, 106, 105,
+ 106, 105, 106, 105, 106, 105, 106, 105, 106, 105,
+ 106, 105, 106, 105, 106, 105, 106, 105, 106, 105,
+ 106, 105, 106, 105, 106, 105, 106, 105, 106, 105,
+ 106, 96, 94, 93, 93, 100, 98, 102, 97, 1,
+ 80, 37, 62, 20, 96, 93, 93, 101, 102, 17,
+ 102, 103, 56, 61, 35, 30, 38, 59, 3, 47,
+
+ 58, 22, 70, 60, 79, 74, 75, 57, 63, 95,
+ 102, 102, 42, 71, 72, 87, 88, 49, 19, 99,
+ 23, 4, 54, 48, 41, 11, 102, 32, 2, 5,
+ 51, 53, 43, 65, 69, 67, 68, 66, 64, 45,
+ 89, 44, 50, 18, 77, 86, 40, 52, 27, 21,
+ 39, 7, 82, 29, 85, 34, 55, 73, 81, 24,
+ 25, 83, 46, 78, 76, 6, 26, 33, 8, 14,
+ 9, 10, 31, 12, 36, 28, 84, 90, 92, 13,
+ 91, 15, 16
+ } ;
+
+ static yyconst short int yy_accept[444] =
+ { 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, 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, 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, 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, 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, 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, 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, 142, 142, 142, 142, 143, 144, 145, 145,
+ 145, 145, 145, 145, 146, 146, 146, 146, 147, 147,
+ 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, 160, 161, 162, 162, 162,
+ 163, 164, 165, 166, 166, 166, 166, 166, 167, 168,
+ 168, 168, 168, 168, 168, 168, 168, 168, 169, 169,
+ 169, 169, 169, 169, 169, 170, 171, 171, 171, 171,
+ 171, 172, 173, 173, 173, 173, 173, 174, 174, 175,
+
+ 175, 175, 175, 175, 175, 175, 175, 175, 175, 175,
+ 175, 175, 175, 175, 176, 176, 176, 176, 176, 176,
+ 176, 176, 177, 177, 178, 178, 178, 178, 178, 178,
+ 178, 178, 178, 179, 179, 180, 181, 181, 182, 183,
+ 183, 184, 184
+ } ;
+
+ 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[448] =
+ { 0,
+ 0, 0, 926, 927, 927, 927, 921, 912, 34, 36,
+ 38, 42, 46, 50, 0, 52, 57, 54, 68, 62,
+ 80, 82, 76, 94, 98, 40, 83, 88, 56, 125,
+ 108, 154, 109, 87, 110, 111, 919, 927, 910, 927,
+ 0, 119, 134, 142, 145, 124, 159, 166, 179, 0,
+ 55, 180, 147, 153, 119, 150, 183, 156, 909, 175,
+ 191, 192, 196, 90, 146, 200, 199, 201, 202, 204,
+ 205, 211, 212, 210, 218, 217, 221, 227, 236, 230,
+ 214, 239, 241, 908, 243, 247, 248, 225, 249, 250,
+ 251, 253, 258, 262, 267, 270, 907, 274, 259, 275,
+
+ 279, 263, 284, 41, 285, 286, 288, 84, 294, 906,
+ 0, 308, 310, 905, 318, 330, 0, 904, 300, 304,
+ 903, 314, 902, 282, 901, 320, 324, 331, 900, 332,
+ 312, 333, 336, 899, 337, 342, 338, 341, 344, 345,
+ 352, 349, 356, 353, 346, 360, 363, 364, 367, 370,
+ 371, 373, 374, 375, 377, 898, 897, 378, 31, 896,
+ 379, 895, 894, 404, 392, 395, 380, 408, 893, 383,
+ 892, 388, 399, 891, 398, 416, 422, 386, 391, 426,
+ 424, 427, 428, 429, 432, 430, 440, 434, 436, 437,
+ 442, 446, 443, 455, 890, 444, 927, 458, 475, 461,
+
+ 465, 477, 466, 472, 468, 478, 889, 888, 887, 480,
+ 481, 484, 486, 482, 488, 490, 491, 496, 494, 498,
+ 492, 886, 502, 506, 507, 500, 508, 510, 513, 514,
+ 518, 885, 884, 519, 520, 883, 522, 525, 0, 527,
+ 526, 523, 531, 534, 538, 540, 541, 544, 545, 552,
+ 882, 556, 555, 881, 880, 558, 879, 560, 562, 550,
+ 568, 566, 569, 574, 575, 576, 878, 577, 877, 578,
+ 581, 876, 582, 581, 875, 585, 588, 584, 596, 597,
+ 594, 598, 599, 601, 874, 607, 873, 604, 609, 610,
+ 612, 615, 618, 872, 617, 619, 622, 630, 631, 633,
+
+ 871, 620, 623, 870, 869, 868, 867, 866, 865, 864,
+ 637, 863, 636, 641, 643, 862, 861, 860, 644, 649,
+ 645, 650, 651, 859, 654, 655, 657, 858, 658, 857,
+ 659, 660, 661, 856, 855, 854, 665, 663, 853, 666,
+ 852, 672, 675, 680, 851, 687, 850, 849, 848, 847,
+ 678, 679, 846, 688, 845, 844, 843, 689, 691, 842,
+ 839, 829, 828, 690, 693, 692, 695, 827, 825, 697,
+ 701, 704, 700, 707, 708, 711, 714, 824, 715, 716,
+ 725, 719, 726, 727, 823, 822, 729, 731, 732, 733,
+ 819, 818, 734, 739, 735, 737, 817, 740, 816, 745,
+
+ 741, 751, 752, 757, 758, 759, 760, 761, 762, 763,
+ 765, 767, 770, 812, 769, 771, 774, 783, 773, 777,
+ 784, 811, 785, 810, 787, 791, 793, 795, 797, 799,
+ 802, 803, 805, 804, 625, 542, 806, 387, 255, 809,
+ 219, 927, 843, 845, 182, 849, 139
+ } ;
+
+ static yyconst short int yy_def[448] =
+ { 0,
+ 442, 1, 442, 442, 442, 442, 443, 444, 445, 442,
+ 444, 444, 444, 444, 446, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 443, 442, 444, 442,
+ 447, 447, 442, 442, 444, 444, 444, 444, 444, 446,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 442,
+ 447, 447, 442, 444, 444, 444, 49, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 49, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 442, 442, 442, 442,
+
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 164, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 442, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 444, 444, 444, 444, 444, 444, 444, 444, 444,
+ 444, 0, 442, 442, 442, 442, 442
+ } ;
+
+ static yyconst short int yy_nxt[969] =
+ { 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, 237, 40, 188, 40, 40, 40, 40, 81,
+ 60, 51, 61, 40, 118, 82, 87, 56, 52, 40,
+ 53, 57, 54, 62, 49, 55, 58, 40, 63, 59,
+ 66, 40, 64, 40, 40, 40, 68, 65, 40, 40,
+
+ 67, 40, 71, 73, 74, 40, 69, 107, 72, 40,
+ 75, 85, 70, 83, 78, 84, 195, 86, 76, 40,
+ 40, 40, 40, 77, 96, 105, 134, 79, 112, 112,
+ 40, 109, 114, 80, 88, 40, 40, 97, 106, 108,
+ 98, 111, 89, 43, 43, 90, 123, 99, 91, 92,
+ 113, 44, 44, 47, 45, 45, 40, 40, 40, 93,
+ 94, 40, 95, 88, 40, 40, 121, 40, 115, 115,
+ 40, 100, 124, 116, 47, 48, 48, 40, 101, 116,
+ 102, 135, 103, 122, 41, 126, 40, 104, 117, 117,
+ 40, 40, 117, 117, 40, 117, 117, 117, 117, 117,
+
+ 117, 127, 40, 40, 119, 125, 120, 40, 128, 129,
+ 40, 40, 40, 40, 132, 40, 40, 137, 130, 136,
+ 131, 40, 40, 40, 142, 40, 133, 139, 40, 40,
+ 40, 141, 40, 138, 140, 149, 40, 152, 40, 143,
+ 144, 40, 145, 146, 147, 150, 148, 40, 157, 153,
+ 40, 151, 40, 154, 40, 155, 156, 159, 40, 40,
+ 40, 40, 40, 164, 40, 158, 40, 160, 166, 40,
+ 40, 161, 172, 40, 40, 162, 167, 169, 40, 174,
+ 170, 40, 163, 171, 168, 40, 40, 173, 165, 180,
+ 40, 175, 183, 40, 176, 40, 40, 40, 178, 40,
+
+ 189, 190, 177, 184, 194, 40, 206, 182, 185, 179,
+ 192, 40, 193, 191, 181, 40, 186, 112, 112, 198,
+ 198, 187, 203, 40, 199, 40, 196, 115, 115, 40,
+ 199, 40, 116, 204, 205, 40, 200, 201, 116, 202,
+ 202, 40, 40, 40, 40, 211, 207, 40, 40, 40,
+ 208, 210, 40, 40, 214, 40, 40, 40, 216, 212,
+ 40, 217, 213, 40, 40, 209, 215, 40, 221, 222,
+ 224, 40, 225, 218, 40, 40, 223, 219, 40, 220,
+ 226, 40, 40, 227, 40, 40, 40, 229, 40, 40,
+ 40, 40, 232, 228, 40, 230, 233, 40, 40, 40,
+
+ 242, 234, 40, 40, 236, 231, 40, 238, 248, 40,
+ 40, 254, 235, 239, 239, 247, 253, 239, 239, 40,
+ 239, 239, 239, 239, 239, 239, 240, 40, 243, 241,
+ 244, 249, 250, 40, 245, 40, 246, 40, 40, 40,
+ 40, 40, 251, 40, 252, 40, 255, 40, 40, 259,
+ 261, 40, 264, 40, 40, 40, 258, 40, 256, 268,
+ 260, 257, 266, 263, 262, 267, 40, 198, 198, 265,
+ 271, 271, 199, 270, 202, 202, 40, 40, 199, 40,
+ 269, 200, 200, 40, 271, 271, 202, 202, 40, 40,
+ 273, 40, 40, 40, 272, 40, 274, 40, 276, 40,
+
+ 278, 40, 40, 40, 281, 40, 275, 40, 280, 40,
+ 279, 40, 284, 40, 285, 277, 286, 40, 40, 40,
+ 282, 40, 289, 283, 40, 40, 287, 290, 288, 40,
+ 40, 40, 291, 40, 40, 293, 40, 40, 40, 294,
+ 292, 303, 40, 295, 296, 40, 298, 301, 297, 40,
+ 302, 40, 40, 40, 305, 40, 40, 299, 307, 300,
+ 309, 40, 304, 40, 311, 312, 40, 40, 306, 40,
+ 313, 40, 308, 40, 319, 310, 314, 40, 316, 40,
+ 40, 315, 317, 318, 320, 40, 40, 40, 40, 40,
+ 271, 271, 40, 40, 321, 40, 40, 324, 328, 40,
+
+ 329, 322, 327, 330, 331, 40, 323, 40, 40, 40,
+ 40, 326, 40, 333, 325, 40, 332, 334, 40, 338,
+ 40, 40, 335, 40, 340, 339, 40, 337, 40, 40,
+ 40, 40, 336, 40, 40, 341, 40, 342, 345, 347,
+ 348, 40, 40, 344, 40, 346, 343, 40, 40, 352,
+ 349, 350, 40, 351, 40, 40, 40, 353, 354, 355,
+ 40, 40, 40, 357, 360, 40, 40, 359, 40, 40,
+ 40, 40, 40, 362, 40, 356, 40, 40, 358, 364,
+ 368, 370, 366, 40, 361, 365, 40, 367, 363, 40,
+ 40, 40, 373, 372, 369, 374, 375, 371, 40, 40,
+
+ 40, 40, 40, 40, 40, 376, 40, 378, 40, 379,
+ 377, 40, 40, 380, 381, 40, 382, 383, 40, 40,
+ 384, 387, 40, 386, 388, 40, 40, 40, 389, 385,
+ 40, 392, 395, 390, 391, 394, 40, 40, 40, 397,
+ 40, 396, 40, 40, 40, 40, 40, 393, 40, 399,
+ 40, 40, 40, 403, 407, 400, 40, 405, 404, 401,
+ 398, 406, 40, 40, 408, 409, 402, 411, 40, 40,
+ 40, 40, 40, 40, 40, 410, 40, 417, 40, 412,
+ 40, 40, 40, 415, 40, 40, 416, 421, 40, 418,
+ 422, 424, 414, 419, 40, 40, 40, 413, 40, 420,
+
+ 425, 428, 40, 426, 40, 430, 40, 427, 40, 423,
+ 40, 431, 429, 40, 40, 40, 40, 40, 436, 432,
+ 40, 40, 40, 40, 434, 433, 440, 40, 40, 40,
+ 40, 435, 439, 40, 40, 40, 40, 438, 40, 40,
+ 40, 441, 437, 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, 197, 40, 40,
+ 40, 40, 110, 40, 38, 442, 3, 442, 442, 442,
+ 442, 442, 442, 442, 442, 442, 442, 442, 442, 442,
+ 442, 442, 442, 442, 442, 442, 442, 442, 442, 442,
+ 442, 442, 442, 442, 442, 442, 442, 442, 442, 442,
+ 442, 442, 442, 442, 442, 442, 442, 442
+ } ;
+
+ static yyconst short int yy_chk[969] =
+ { 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, 159, 9, 9, 10, 10, 11, 11, 11,
+ 12, 26, 104, 12, 13, 13, 13, 13, 14, 14,
+ 14, 14, 159, 16, 104, 18, 51, 29, 17, 26,
+ 18, 16, 18, 20, 51, 26, 29, 17, 16, 19,
+ 16, 17, 16, 18, 13, 16, 17, 23, 19, 17,
+ 20, 21, 19, 22, 27, 108, 21, 19, 34, 28,
+
+ 20, 64, 22, 23, 23, 24, 21, 34, 22, 25,
+ 24, 28, 21, 27, 25, 27, 108, 28, 24, 31,
+ 33, 35, 36, 24, 31, 33, 64, 25, 42, 42,
+ 55, 36, 46, 25, 30, 46, 30, 31, 33, 35,
+ 31, 447, 30, 43, 43, 30, 55, 31, 30, 30,
+ 44, 44, 44, 45, 45, 45, 45, 65, 53, 30,
+ 30, 56, 30, 32, 54, 32, 53, 58, 47, 47,
+ 47, 32, 56, 47, 48, 48, 48, 48, 32, 47,
+ 32, 65, 32, 54, 445, 58, 60, 32, 49, 49,
+ 49, 52, 49, 49, 57, 49, 49, 49, 49, 49,
+
+ 49, 60, 61, 62, 52, 57, 52, 63, 60, 61,
+ 67, 66, 68, 69, 63, 70, 71, 67, 62, 66,
+ 62, 74, 72, 73, 70, 81, 63, 68, 76, 75,
+ 441, 69, 77, 67, 68, 75, 88, 77, 78, 71,
+ 72, 80, 73, 74, 74, 76, 74, 79, 81, 77,
+ 82, 76, 83, 78, 85, 79, 80, 83, 86, 87,
+ 89, 90, 91, 88, 92, 82, 439, 85, 90, 93,
+ 99, 86, 92, 94, 102, 87, 90, 91, 95, 94,
+ 91, 96, 87, 91, 90, 98, 100, 93, 89, 99,
+ 101, 95, 102, 124, 96, 103, 105, 106, 98, 107,
+
+ 105, 105, 96, 103, 107, 109, 124, 101, 103, 98,
+ 106, 119, 106, 105, 100, 120, 103, 112, 112, 113,
+ 113, 103, 119, 131, 113, 122, 109, 115, 115, 115,
+ 113, 126, 115, 120, 122, 127, 116, 116, 115, 116,
+ 116, 116, 128, 130, 132, 131, 126, 133, 135, 137,
+ 127, 130, 138, 136, 135, 139, 140, 145, 137, 132,
+ 142, 138, 133, 141, 144, 128, 136, 143, 141, 142,
+ 144, 146, 145, 138, 147, 148, 143, 139, 149, 140,
+ 146, 150, 151, 147, 152, 153, 154, 149, 155, 158,
+ 161, 167, 152, 148, 170, 150, 153, 178, 438, 172,
+
+ 167, 154, 179, 165, 158, 151, 166, 161, 172, 175,
+ 173, 179, 155, 164, 164, 170, 178, 164, 164, 168,
+ 164, 164, 164, 164, 164, 164, 165, 176, 168, 166,
+ 168, 173, 175, 177, 168, 181, 168, 180, 182, 183,
+ 184, 186, 176, 185, 177, 188, 180, 189, 190, 184,
+ 186, 187, 189, 191, 193, 196, 183, 192, 181, 193,
+ 185, 182, 191, 188, 187, 192, 194, 198, 198, 190,
+ 200, 200, 198, 196, 201, 201, 201, 203, 198, 205,
+ 194, 199, 199, 204, 199, 199, 202, 202, 202, 206,
+ 204, 210, 211, 214, 203, 212, 205, 213, 210, 215,
+
+ 212, 216, 217, 221, 215, 219, 206, 218, 214, 220,
+ 213, 226, 218, 223, 219, 211, 220, 224, 225, 227,
+ 216, 228, 224, 217, 229, 230, 221, 225, 223, 231,
+ 234, 235, 226, 237, 242, 228, 238, 241, 240, 229,
+ 227, 242, 243, 230, 231, 244, 235, 240, 234, 245,
+ 241, 246, 247, 436, 244, 248, 249, 237, 245, 238,
+ 246, 260, 243, 250, 248, 249, 253, 252, 244, 256,
+ 250, 258, 245, 259, 260, 247, 252, 262, 256, 261,
+ 263, 253, 258, 259, 261, 264, 265, 266, 268, 270,
+ 271, 271, 274, 273, 262, 278, 276, 265, 273, 277,
+
+ 274, 263, 270, 276, 277, 281, 264, 279, 280, 282,
+ 283, 268, 284, 279, 266, 288, 278, 280, 286, 284,
+ 289, 290, 281, 291, 288, 286, 292, 283, 295, 293,
+ 296, 302, 282, 297, 303, 289, 435, 290, 293, 296,
+ 297, 298, 299, 292, 300, 295, 291, 313, 311, 302,
+ 298, 299, 314, 300, 315, 319, 321, 303, 311, 313,
+ 320, 322, 323, 315, 321, 325, 326, 320, 327, 329,
+ 331, 332, 333, 323, 338, 314, 337, 340, 319, 326,
+ 332, 337, 329, 342, 322, 327, 343, 331, 325, 351,
+ 352, 344, 342, 340, 333, 343, 344, 338, 346, 354,
+
+ 358, 364, 359, 366, 365, 346, 367, 352, 370, 354,
+ 351, 373, 371, 358, 359, 372, 364, 365, 374, 375,
+ 366, 371, 376, 370, 372, 377, 379, 380, 373, 367,
+ 382, 376, 380, 374, 375, 379, 381, 383, 384, 382,
+ 387, 381, 388, 389, 390, 393, 395, 377, 396, 384,
+ 394, 398, 401, 390, 396, 387, 400, 394, 393, 388,
+ 383, 395, 402, 403, 398, 400, 389, 402, 404, 405,
+ 406, 407, 408, 409, 410, 401, 411, 408, 412, 403,
+ 415, 413, 416, 406, 419, 417, 407, 412, 420, 409,
+ 413, 416, 405, 410, 418, 421, 423, 404, 425, 411,
+
+ 417, 420, 426, 418, 427, 423, 428, 419, 429, 415,
+ 430, 425, 421, 431, 432, 434, 433, 437, 430, 426,
+ 440, 424, 422, 414, 428, 427, 437, 399, 397, 392,
+ 391, 429, 434, 386, 385, 378, 369, 432, 368, 363,
+ 362, 440, 431, 443, 443, 443, 443, 444, 444, 446,
+ 361, 446, 446, 360, 357, 356, 355, 353, 350, 349,
+ 348, 347, 345, 341, 339, 336, 335, 334, 330, 328,
+ 324, 318, 317, 316, 312, 310, 309, 308, 307, 306,
+ 305, 304, 301, 294, 287, 285, 275, 272, 269, 267,
+ 257, 255, 254, 251, 236, 233, 232, 222, 209, 208,
+
+ 207, 195, 174, 171, 169, 163, 162, 160, 157, 156,
+ 134, 129, 125, 123, 121, 118, 114, 110, 97, 84,
+ 59, 39, 37, 8, 7, 3, 442, 442, 442, 442,
+ 442, 442, 442, 442, 442, 442, 442, 442, 442, 442,
+ 442, 442, 442, 442, 442, 442, 442, 442, 442, 442,
+ 442, 442, 442, 442, 442, 442, 442, 442, 442, 442,
+ 442, 442, 442, 442, 442, 442, 442, 442
+ } ;
+
+ 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 "/Users/sabre/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 "/Users/sabre/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 913 "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 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+
+
+ #line 1067 "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 >= 443 )
+ 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 != 442 );
+
+ 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 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { /* Ignore comments for now */ }
+ YY_BREAK
+ case 2:
+ YY_RULE_SETUP
+ #line 183 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return BEGINTOK; }
+ YY_BREAK
+ case 3:
+ YY_RULE_SETUP
+ #line 184 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return ENDTOK; }
+ YY_BREAK
+ case 4:
+ YY_RULE_SETUP
+ #line 185 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return TRUETOK; }
+ YY_BREAK
+ case 5:
+ YY_RULE_SETUP
+ #line 186 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return FALSETOK; }
+ YY_BREAK
+ case 6:
+ YY_RULE_SETUP
+ #line 187 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return DECLARE; }
+ YY_BREAK
+ case 7:
+ YY_RULE_SETUP
+ #line 188 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return GLOBAL; }
+ YY_BREAK
+ case 8:
+ YY_RULE_SETUP
+ #line 189 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return CONSTANT; }
+ YY_BREAK
+ case 9:
+ YY_RULE_SETUP
+ #line 190 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return INTERNAL; }
+ YY_BREAK
+ case 10:
+ YY_RULE_SETUP
+ #line 191 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return LINKONCE; }
+ YY_BREAK
+ case 11:
+ YY_RULE_SETUP
+ #line 192 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return WEAK; }
+ YY_BREAK
+ case 12:
+ YY_RULE_SETUP
+ #line 193 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return APPENDING; }
+ YY_BREAK
+ case 13:
+ YY_RULE_SETUP
+ #line 194 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return EXTERNAL; } /* Deprecated, turn into external */
+ YY_BREAK
+ case 14:
+ YY_RULE_SETUP
+ #line 195 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return EXTERNAL; }
+ YY_BREAK
+ case 15:
+ YY_RULE_SETUP
+ #line 196 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return IMPLEMENTATION; }
+ YY_BREAK
+ case 16:
+ YY_RULE_SETUP
+ #line 197 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return ZEROINITIALIZER; }
+ YY_BREAK
+ case 17:
+ YY_RULE_SETUP
+ #line 198 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return DOTDOTDOT; }
+ YY_BREAK
+ case 18:
+ YY_RULE_SETUP
+ #line 199 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return UNDEF; }
+ YY_BREAK
+ case 19:
+ YY_RULE_SETUP
+ #line 200 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return NULL_TOK; }
+ YY_BREAK
+ case 20:
+ YY_RULE_SETUP
+ #line 201 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return TO; }
+ YY_BREAK
+ case 21:
+ YY_RULE_SETUP
+ #line 202 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(TermOpVal, Unwind, UNWIND); }
+ YY_BREAK
+ case 22:
+ YY_RULE_SETUP
+ #line 203 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return NOT; } /* Deprecated, turned into XOR */
+ YY_BREAK
+ case 23:
+ YY_RULE_SETUP
+ #line 204 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return TAIL; }
+ YY_BREAK
+ case 24:
+ YY_RULE_SETUP
+ #line 205 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return TARGET; }
+ YY_BREAK
+ case 25:
+ YY_RULE_SETUP
+ #line 206 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return TRIPLE; }
+ YY_BREAK
+ case 26:
+ YY_RULE_SETUP
+ #line 207 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return DEPLIBS; }
+ YY_BREAK
+ case 27:
+ YY_RULE_SETUP
+ #line 208 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return ENDIAN; }
+ YY_BREAK
+ case 28:
+ YY_RULE_SETUP
+ #line 209 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return POINTERSIZE; }
+ YY_BREAK
+ case 29:
+ YY_RULE_SETUP
+ #line 210 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return LITTLE; }
+ YY_BREAK
+ case 30:
+ YY_RULE_SETUP
+ #line 211 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return BIG; }
+ YY_BREAK
+ case 31:
+ YY_RULE_SETUP
+ #line 212 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return VOLATILE; }
+ YY_BREAK
+ case 32:
+ YY_RULE_SETUP
+ #line 213 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return ALIGN; }
+ YY_BREAK
+ case 33:
+ YY_RULE_SETUP
+ #line 214 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return SECTION; }
+ YY_BREAK
+ case 34:
+ YY_RULE_SETUP
+ #line 215 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return MODULE; }
+ YY_BREAK
+ case 35:
+ YY_RULE_SETUP
+ #line 216 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return ASM_TOK; }
+ YY_BREAK
+ case 36:
+ YY_RULE_SETUP
+ #line 217 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return SIDEEFFECT; }
+ YY_BREAK
+ case 37:
+ YY_RULE_SETUP
+ #line 219 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return CC_TOK; }
+ YY_BREAK
+ case 38:
+ YY_RULE_SETUP
+ #line 220 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return CCC_TOK; }
+ YY_BREAK
+ case 39:
+ YY_RULE_SETUP
+ #line 221 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return FASTCC_TOK; }
+ YY_BREAK
+ case 40:
+ YY_RULE_SETUP
+ #line 222 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return COLDCC_TOK; }
+ YY_BREAK
+ case 41:
+ YY_RULE_SETUP
+ #line 224 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.PrimType = Type::VoidTy ; return VOID; }
+ YY_BREAK
+ case 42:
+ YY_RULE_SETUP
+ #line 225 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.PrimType = Type::BoolTy ; return BOOL; }
+ YY_BREAK
+ case 43:
+ YY_RULE_SETUP
+ #line 226 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.PrimType = Type::SByteTy ; return SBYTE; }
+ YY_BREAK
+ case 44:
+ YY_RULE_SETUP
+ #line 227 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.PrimType = Type::UByteTy ; return UBYTE; }
+ YY_BREAK
+ case 45:
+ YY_RULE_SETUP
+ #line 228 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.PrimType = Type::ShortTy ; return SHORT; }
+ YY_BREAK
+ case 46:
+ YY_RULE_SETUP
+ #line 229 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.PrimType = Type::UShortTy; return USHORT; }
+ YY_BREAK
+ case 47:
+ YY_RULE_SETUP
+ #line 230 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.PrimType = Type::IntTy ; return INT; }
+ YY_BREAK
+ case 48:
+ YY_RULE_SETUP
+ #line 231 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.PrimType = Type::UIntTy ; return UINT; }
+ YY_BREAK
+ case 49:
+ YY_RULE_SETUP
+ #line 232 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.PrimType = Type::LongTy ; return LONG; }
+ YY_BREAK
+ case 50:
+ YY_RULE_SETUP
+ #line 233 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.PrimType = Type::ULongTy ; return ULONG; }
+ YY_BREAK
+ case 51:
+ YY_RULE_SETUP
+ #line 234 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.PrimType = Type::FloatTy ; return FLOAT; }
+ YY_BREAK
+ case 52:
+ YY_RULE_SETUP
+ #line 235 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.PrimType = Type::DoubleTy; return DOUBLE; }
+ YY_BREAK
+ case 53:
+ YY_RULE_SETUP
+ #line 236 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.PrimType = Type::LabelTy ; return LABEL; }
+ YY_BREAK
+ case 54:
+ YY_RULE_SETUP
+ #line 237 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return TYPE; }
+ YY_BREAK
+ case 55:
+ YY_RULE_SETUP
+ #line 238 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return OPAQUE; }
+ YY_BREAK
+ case 56:
+ YY_RULE_SETUP
+ #line 240 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, Add, ADD); }
+ YY_BREAK
+ case 57:
+ YY_RULE_SETUP
+ #line 241 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, Sub, SUB); }
+ YY_BREAK
+ case 58:
+ YY_RULE_SETUP
+ #line 242 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, Mul, MUL); }
+ YY_BREAK
+ case 59:
+ YY_RULE_SETUP
+ #line 243 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, Div, DIV); }
+ YY_BREAK
+ case 60:
+ YY_RULE_SETUP
+ #line 244 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, Rem, REM); }
+ YY_BREAK
+ case 61:
+ YY_RULE_SETUP
+ #line 245 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, And, AND); }
+ YY_BREAK
+ case 62:
+ YY_RULE_SETUP
+ #line 246 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, Or , OR ); }
+ YY_BREAK
+ case 63:
+ YY_RULE_SETUP
+ #line 247 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, Xor, XOR); }
+ YY_BREAK
+ case 64:
+ YY_RULE_SETUP
+ #line 248 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, SetNE, SETNE); }
+ YY_BREAK
+ case 65:
+ YY_RULE_SETUP
+ #line 249 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, SetEQ, SETEQ); }
+ YY_BREAK
+ case 66:
+ YY_RULE_SETUP
+ #line 250 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, SetLT, SETLT); }
+ YY_BREAK
+ case 67:
+ YY_RULE_SETUP
+ #line 251 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, SetGT, SETGT); }
+ YY_BREAK
+ case 68:
+ YY_RULE_SETUP
+ #line 252 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, SetLE, SETLE); }
+ YY_BREAK
+ case 69:
+ YY_RULE_SETUP
+ #line 253 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(BinaryOpVal, SetGE, SETGE); }
+ YY_BREAK
+ case 70:
+ YY_RULE_SETUP
+ #line 255 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(OtherOpVal, PHI, PHI_TOK); }
+ YY_BREAK
+ case 71:
+ YY_RULE_SETUP
+ #line 256 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(OtherOpVal, Call, CALL); }
+ YY_BREAK
+ case 72:
+ YY_RULE_SETUP
+ #line 257 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(OtherOpVal, Cast, CAST); }
+ YY_BREAK
+ case 73:
+ YY_RULE_SETUP
+ #line 258 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(OtherOpVal, Select, SELECT); }
+ YY_BREAK
+ case 74:
+ YY_RULE_SETUP
+ #line 259 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(OtherOpVal, Shl, SHL); }
+ YY_BREAK
+ case 75:
+ YY_RULE_SETUP
+ #line 260 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(OtherOpVal, Shr, SHR); }
+ YY_BREAK
+ case 76:
+ YY_RULE_SETUP
+ #line 261 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return VANEXT_old; }
+ YY_BREAK
+ case 77:
+ YY_RULE_SETUP
+ #line 262 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return VAARG_old; }
+ YY_BREAK
+ case 78:
+ YY_RULE_SETUP
+ #line 263 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(OtherOpVal, VAArg , VAARG); }
+ YY_BREAK
+ case 79:
+ YY_RULE_SETUP
+ #line 264 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(TermOpVal, Ret, RET); }
+ YY_BREAK
+ case 80:
+ YY_RULE_SETUP
+ #line 265 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(TermOpVal, Br, BR); }
+ YY_BREAK
+ case 81:
+ YY_RULE_SETUP
+ #line 266 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(TermOpVal, Switch, SWITCH); }
+ YY_BREAK
+ case 82:
+ YY_RULE_SETUP
+ #line 267 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(TermOpVal, Invoke, INVOKE); }
+ YY_BREAK
+ case 83:
+ YY_RULE_SETUP
+ #line 268 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(TermOpVal, Unwind, UNWIND); }
+ YY_BREAK
+ case 84:
+ YY_RULE_SETUP
+ #line 269 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(TermOpVal, Unreachable, UNREACHABLE); }
+ YY_BREAK
+ case 85:
+ YY_RULE_SETUP
+ #line 271 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(MemOpVal, Malloc, MALLOC); }
+ YY_BREAK
+ case 86:
+ YY_RULE_SETUP
+ #line 272 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(MemOpVal, Alloca, ALLOCA); }
+ YY_BREAK
+ case 87:
+ YY_RULE_SETUP
+ #line 273 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(MemOpVal, Free, FREE); }
+ YY_BREAK
+ case 88:
+ YY_RULE_SETUP
+ #line 274 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(MemOpVal, Load, LOAD); }
+ YY_BREAK
+ case 89:
+ YY_RULE_SETUP
+ #line 275 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(MemOpVal, Store, STORE); }
+ YY_BREAK
+ case 90:
+ YY_RULE_SETUP
+ #line 276 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(MemOpVal, GetElementPtr, GETELEMENTPTR); }
+ YY_BREAK
+ case 91:
+ YY_RULE_SETUP
+ #line 278 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(OtherOpVal, ExtractElement, EXTRACTELEMENT); }
+ YY_BREAK
+ case 92:
+ YY_RULE_SETUP
+ #line 279 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { RET_TOK(OtherOpVal, InsertElement, INSERTELEMENT); }
+ YY_BREAK
+ case 93:
+ YY_RULE_SETUP
+ #line 282 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ {
+ UnEscapeLexed(yytext+1);
+ llvmAsmlval.StrVal = strdup(yytext+1); // Skip %
+ return VAR_ID;
+ }
+ YY_BREAK
+ case 94:
+ YY_RULE_SETUP
+ #line 287 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ {
+ yytext[strlen(yytext)-1] = 0; // nuke colon
+ UnEscapeLexed(yytext);
+ llvmAsmlval.StrVal = strdup(yytext);
+ return LABELSTR;
+ }
+ YY_BREAK
+ case 95:
+ YY_RULE_SETUP
+ #line 293 "/Users/sabre/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 96:
+ YY_RULE_SETUP
+ #line 300 "/Users/sabre/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 97:
+ YY_RULE_SETUP
+ #line 311 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.UInt64Val = atoull(yytext); return EUINT64VAL; }
+ YY_BREAK
+ case 98:
+ YY_RULE_SETUP
+ #line 312 "/Users/sabre/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 99:
+ YY_RULE_SETUP
+ #line 320 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ {
+ llvmAsmlval.UInt64Val = HexIntToVal(yytext+3);
+ return yytext[0] == 's' ? ESINT64VAL : EUINT64VAL;
+ }
+ YY_BREAK
+ case 100:
+ YY_RULE_SETUP
+ #line 325 "/Users/sabre/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 101:
+ YY_RULE_SETUP
+ #line 332 "/Users/sabre/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 102:
+ YY_RULE_SETUP
+ #line 341 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.FPVal = atof(yytext); return FPVAL; }
+ YY_BREAK
+ case 103:
+ YY_RULE_SETUP
+ #line 342 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { llvmAsmlval.FPVal = HexToFP(yytext); return FPVAL; }
+ YY_BREAK
+ case YY_STATE_EOF(INITIAL):
+ #line 344 "/Users/sabre/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 104:
+ YY_RULE_SETUP
+ #line 352 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { /* Ignore whitespace */ }
+ YY_BREAK
+ case 105:
+ YY_RULE_SETUP
+ #line 353 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ { return yytext[0]; }
+ YY_BREAK
+ case 106:
+ YY_RULE_SETUP
+ #line 355 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+ YY_FATAL_ERROR( "flex scanner jammed" );
+ YY_BREAK
+ #line 1743 "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 >= 443 )
+ 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 >= 443 )
+ 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 == 442);
+ 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 EOF;
+
+ if ( ! yy_did_buffer_switch_on_eof )
+ YY_NEW_FILE;
+ #ifdef __cplusplus
+ return yyinput();
+ #else
+ return input();
+ #endif
+ }
+
+ case EOB_ACT_CONTINUE_SCAN:
+ yy_c_buf_p = yytext_ptr + offset;
+ break;
+ }
+ }
+ }
+
+ c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */
+ *yy_c_buf_p = '\0'; /* preserve yytext */
+ yy_hold_char = *++yy_c_buf_p;
+
+ 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 355 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l"
+
Index: llvm/lib/AsmParser/Lexer.l.cvs
diff -c /dev/null llvm/lib/AsmParser/Lexer.l.cvs:1.1
*** /dev/null Mon Feb 13 23:14:58 2006
--- llvm/lib/AsmParser/Lexer.l.cvs Mon Feb 13 23:14:46 2006
***************
*** 0 ****
--- 1,355 ----
+ /*===-- 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.
+ //
+ //===----------------------------------------------------------------------===*/
+
+ %option prefix="llvmAsm"
+ %option yylineno
+ %option nostdinit
+ %option never-interactive
+ %option batch
+ %option noyywrap
+ %option nodefault
+ %option 8bit
+ %option outfile="Lexer.cpp"
+ %option ecs
+ %option noreject
+ %option noyymore
+
+ %{
+ #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 */
+ Comment ;.*
+
+ /* Variable(Value) identifiers start with a % sign */
+ VarID %[-a-zA-Z$._][-a-zA-Z$._0-9]*
+
+ /* Label identifiers end with a colon */
+ Label [-a-zA-Z$._0-9]+:
+ QuoteLabel \"[^\"]+\":
+
+ /* Quoted names can contain any character except " and \ */
+ StringConstant \"[^\"]*\"
+
+
+ /* [PN]Integer: match positive and negative literal integer values that
+ * are preceeded by a '%' character. These represent unnamed variable slots.
+ */
+ EPInteger %[0-9]+
+ ENInteger %-[0-9]+
+
+
+ /* E[PN]Integer: match positive and negative literal integer values */
+ PInteger [0-9]+
+ NInteger -[0-9]+
+
+ /* FPConstant - A Floating point constant.
+ */
+ FPConstant [-+]?[0-9]+[.][0-9]*([eE][-+]?[0-9]+)?
+
+ /* HexFPConstant - Floating point constant represented in IEEE format as a
+ * hexadecimal number for when exponential notation is not precise enough.
+ */
+ HexFPConstant 0x[0-9A-Fa-f]+
+
+ /* HexIntConstant - Hexadecimal constant generated by the CFE to avoid forcing
+ * it to deal with 64 bit numbers.
+ */
+ HexIntConstant [us]0x[0-9A-Fa-f]+
+ %%
+
+ {Comment} { /* Ignore comments for now */ }
+
+ begin { return BEGINTOK; }
+ end { return ENDTOK; }
+ true { return TRUETOK; }
+ false { return FALSETOK; }
+ declare { return DECLARE; }
+ global { return GLOBAL; }
+ constant { return CONSTANT; }
+ internal { return INTERNAL; }
+ linkonce { return LINKONCE; }
+ weak { return WEAK; }
+ appending { return APPENDING; }
+ uninitialized { return EXTERNAL; } /* Deprecated, turn into external */
+ external { return EXTERNAL; }
+ implementation { return IMPLEMENTATION; }
+ zeroinitializer { return ZEROINITIALIZER; }
+ \.\.\. { return DOTDOTDOT; }
+ undef { return UNDEF; }
+ null { return NULL_TOK; }
+ to { return TO; }
+ except { RET_TOK(TermOpVal, Unwind, UNWIND); }
+ not { return NOT; } /* Deprecated, turned into XOR */
+ tail { return TAIL; }
+ target { return TARGET; }
+ triple { return TRIPLE; }
+ deplibs { return DEPLIBS; }
+ endian { return ENDIAN; }
+ pointersize { return POINTERSIZE; }
+ little { return LITTLE; }
+ big { return BIG; }
+ volatile { return VOLATILE; }
+ align { return ALIGN; }
+ section { return SECTION; }
+ module { return MODULE; }
+ asm { return ASM_TOK; }
+ sideeffect { return SIDEEFFECT; }
+
+ cc { return CC_TOK; }
+ ccc { return CCC_TOK; }
+ fastcc { return FASTCC_TOK; }
+ coldcc { return COLDCC_TOK; }
+
+ void { llvmAsmlval.PrimType = Type::VoidTy ; return VOID; }
+ bool { llvmAsmlval.PrimType = Type::BoolTy ; return BOOL; }
+ sbyte { llvmAsmlval.PrimType = Type::SByteTy ; return SBYTE; }
+ ubyte { llvmAsmlval.PrimType = Type::UByteTy ; return UBYTE; }
+ short { llvmAsmlval.PrimType = Type::ShortTy ; return SHORT; }
+ ushort { llvmAsmlval.PrimType = Type::UShortTy; return USHORT; }
+ int { llvmAsmlval.PrimType = Type::IntTy ; return INT; }
+ uint { llvmAsmlval.PrimType = Type::UIntTy ; return UINT; }
+ long { llvmAsmlval.PrimType = Type::LongTy ; return LONG; }
+ ulong { llvmAsmlval.PrimType = Type::ULongTy ; return ULONG; }
+ float { llvmAsmlval.PrimType = Type::FloatTy ; return FLOAT; }
+ double { llvmAsmlval.PrimType = Type::DoubleTy; return DOUBLE; }
+ label { llvmAsmlval.PrimType = Type::LabelTy ; return LABEL; }
+ type { return TYPE; }
+ opaque { return OPAQUE; }
+
+ add { RET_TOK(BinaryOpVal, Add, ADD); }
+ sub { RET_TOK(BinaryOpVal, Sub, SUB); }
+ mul { RET_TOK(BinaryOpVal, Mul, MUL); }
+ div { RET_TOK(BinaryOpVal, Div, DIV); }
+ rem { RET_TOK(BinaryOpVal, Rem, REM); }
+ and { RET_TOK(BinaryOpVal, And, AND); }
+ or { RET_TOK(BinaryOpVal, Or , OR ); }
+ xor { RET_TOK(BinaryOpVal, Xor, XOR); }
+ setne { RET_TOK(BinaryOpVal, SetNE, SETNE); }
+ seteq { RET_TOK(BinaryOpVal, SetEQ, SETEQ); }
+ setlt { RET_TOK(BinaryOpVal, SetLT, SETLT); }
+ setgt { RET_TOK(BinaryOpVal, SetGT, SETGT); }
+ setle { RET_TOK(BinaryOpVal, SetLE, SETLE); }
+ setge { RET_TOK(BinaryOpVal, SetGE, SETGE); }
+
+ phi { RET_TOK(OtherOpVal, PHI, PHI_TOK); }
+ call { RET_TOK(OtherOpVal, Call, CALL); }
+ cast { RET_TOK(OtherOpVal, Cast, CAST); }
+ select { RET_TOK(OtherOpVal, Select, SELECT); }
+ shl { RET_TOK(OtherOpVal, Shl, SHL); }
+ shr { RET_TOK(OtherOpVal, Shr, SHR); }
+ vanext { return VANEXT_old; }
+ vaarg { return VAARG_old; }
+ va_arg { RET_TOK(OtherOpVal, VAArg , VAARG); }
+ ret { RET_TOK(TermOpVal, Ret, RET); }
+ br { RET_TOK(TermOpVal, Br, BR); }
+ switch { RET_TOK(TermOpVal, Switch, SWITCH); }
+ invoke { RET_TOK(TermOpVal, Invoke, INVOKE); }
+ unwind { RET_TOK(TermOpVal, Unwind, UNWIND); }
+ unreachable { RET_TOK(TermOpVal, Unreachable, UNREACHABLE); }
+
+ malloc { RET_TOK(MemOpVal, Malloc, MALLOC); }
+ alloca { RET_TOK(MemOpVal, Alloca, ALLOCA); }
+ free { RET_TOK(MemOpVal, Free, FREE); }
+ load { RET_TOK(MemOpVal, Load, LOAD); }
+ store { RET_TOK(MemOpVal, Store, STORE); }
+ getelementptr { RET_TOK(MemOpVal, GetElementPtr, GETELEMENTPTR); }
+
+ extractelement { RET_TOK(OtherOpVal, ExtractElement, EXTRACTELEMENT); }
+ insertelement { RET_TOK(OtherOpVal, InsertElement, INSERTELEMENT); }
+
+
+ {VarID} {
+ UnEscapeLexed(yytext+1);
+ llvmAsmlval.StrVal = strdup(yytext+1); // Skip %
+ return VAR_ID;
+ }
+ {Label} {
+ yytext[strlen(yytext)-1] = 0; // nuke colon
+ UnEscapeLexed(yytext);
+ llvmAsmlval.StrVal = strdup(yytext);
+ return LABELSTR;
+ }
+ {QuoteLabel} {
+ yytext[strlen(yytext)-2] = 0; // nuke colon, end quote
+ UnEscapeLexed(yytext+1);
+ llvmAsmlval.StrVal = strdup(yytext+1);
+ return LABELSTR;
+ }
+
+ {StringConstant} { // 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;
+ }
+
+
+ {PInteger} { llvmAsmlval.UInt64Val = atoull(yytext); return EUINT64VAL; }
+ {NInteger} {
+ 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;
+ }
+ {HexIntConstant} {
+ llvmAsmlval.UInt64Val = HexIntToVal(yytext+3);
+ return yytext[0] == 's' ? ESINT64VAL : EUINT64VAL;
+ }
+
+ {EPInteger} {
+ uint64_t Val = atoull(yytext+1);
+ if ((unsigned)Val != Val)
+ ThrowException("Invalid value number (too large)!");
+ llvmAsmlval.UIntVal = unsigned(Val);
+ return UINTVAL;
+ }
+ {ENInteger} {
+ 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;
+ }
+
+ {FPConstant} { llvmAsmlval.FPVal = atof(yytext); return FPVAL; }
+ {HexFPConstant} { llvmAsmlval.FPVal = HexToFP(yytext); return FPVAL; }
+
+ <<EOF>> {
+ /* Make sure to free the internal buffers for flex when we are
+ * done reading our input!
+ */
+ yy_delete_buffer(YY_CURRENT_BUFFER);
+ return EOF;
+ }
+
+ [ \r\t\n] { /* Ignore whitespace */ }
+ . { return yytext[0]; }
+
+ %%
More information about the llvm-commits
mailing list