[llvm-commits] CVS: llvm/lib/AsmParser/Lexer.cpp llvmAsmParser.cpp llvmAsmParser.h .cvsignore Makefile
Reid Spencer
reid at x10sys.com
Sat Aug 27 11:50:52 PDT 2005
Changes in directory llvm/lib/AsmParser:
Lexer.cpp updated: 1.9 -> 1.10
llvmAsmParser.cpp updated: 1.16 -> 1.17
llvmAsmParser.h updated: 1.8 -> 1.9
.cvsignore updated: 1.2 -> 1.3
Makefile updated: 1.7 -> 1.8
---
Log message:
Implement PR614: http://llvm.cs.uiuc.edu/PR614 :
These changes modify the makefiles so that the output of flex and bison are
placed in the SRC directory, not the OBJ directory. It is intended that they
be checked in as any other LLVM source so that platforms without convenient
access to flex/bison can be compiled. From now on, if you change a .y or
.l file you *must* also commit the generated .cpp and .h files.
---
Diffs of the changes: (+7414 -5)
.cvsignore | 3
Lexer.cpp | 2551 ++++++++++++++++++++++++++++++
Makefile | 3
llvmAsmParser.cpp | 4590 ++++++++++++++++++++++++++++++++++++++++++++++++++++++
llvmAsmParser.h | 271 +++
5 files changed, 7413 insertions(+), 5 deletions(-)
Index: llvm/lib/AsmParser/Lexer.cpp
diff -u /dev/null llvm/lib/AsmParser/Lexer.cpp:1.10
--- /dev/null Sat Aug 27 13:50:48 2005
+++ llvm/lib/AsmParser/Lexer.cpp Sat Aug 27 13:50:38 2005
@@ -0,0 +1,2552 @@
+#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: /var/cvs/llvm/llvm/lib/AsmParser/Lexer.cpp,v 1.10 2005/08/27 18:50:38 reid Exp $
+ */
+
+#define FLEX_SCANNER
+#define YY_FLEX_MAJOR_VERSION 2
+#define YY_FLEX_MINOR_VERSION 5
+
+#include <stdio.h>
+#include <unistd.h>
+
+
+/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
+#ifdef c_plusplus
+#ifndef __cplusplus
+#define __cplusplus
+#endif
+#endif
+
+
+#ifdef __cplusplus
+
+#include <stdlib.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 99
+#define YY_END_OF_BUFFER 100
+static yyconst short int yy_acclist[177] =
+ { 0,
+ 100, 98, 99, 97, 98, 99, 97, 99, 98, 99,
+ 98, 99, 98, 99, 98, 99, 98, 99, 98, 99,
+ 90, 98, 99, 90, 98, 99, 1, 98, 99, 98,
+ 99, 98, 99, 98, 99, 98, 99, 98, 99, 98,
+ 99, 98, 99, 98, 99, 98, 99, 98, 99, 98,
+ 99, 98, 99, 98, 99, 98, 99, 98, 99, 98,
+ 99, 98, 99, 98, 99, 98, 99, 98, 99, 98,
+ 99, 89, 87, 86, 86, 93, 91, 95, 90, 1,
+ 75, 32, 57, 20, 89, 86, 86, 94, 95, 17,
+ 95, 96, 51, 56, 30, 33, 54, 3, 42, 53,
+
+ 22, 65, 55, 74, 69, 70, 52, 58, 88, 95,
+ 95, 37, 66, 67, 82, 83, 44, 19, 92, 23,
+ 4, 49, 43, 36, 11, 95, 2, 5, 46, 48,
+ 38, 60, 64, 62, 63, 61, 59, 40, 84, 39,
+ 45, 18, 72, 81, 35, 47, 27, 21, 34, 7,
+ 77, 29, 80, 50, 68, 76, 24, 25, 78, 41,
+ 73, 71, 6, 26, 8, 14, 9, 10, 31, 12,
+ 28, 79, 85, 13, 15, 16
+ } ;
+
+static yyconst short int yy_accept[398] =
+ { 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, 82, 82,
+ 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, 85, 85, 85, 85, 85, 85,
+
+ 85, 85, 85, 85, 85, 85, 85, 86, 87, 89,
+ 90, 91, 92, 92, 93, 94, 94, 95, 95, 95,
+ 96, 96, 96, 96, 97, 97, 97, 97, 97, 98,
+ 98, 99, 99, 99, 99, 99, 99, 99, 99, 99,
+ 99, 100, 100, 100, 100, 100, 100, 100, 100, 101,
+ 102, 102, 102, 103, 103, 104, 105, 105, 105, 105,
+ 105, 106, 106, 107, 107, 108, 108, 108, 108, 108,
+ 108, 108, 108, 108, 108, 108, 108, 108, 108, 108,
+ 108, 108, 108, 108, 108, 108, 109, 109, 110, 111,
+ 111, 111, 111, 112, 112, 112, 112, 113, 114, 115,
+
+ 115, 115, 115, 115, 115, 115, 115, 115, 115, 115,
+ 115, 116, 116, 116, 116, 116, 116, 116, 116, 116,
+ 117, 118, 118, 119, 119, 119, 120, 120, 120, 120,
+ 120, 120, 120, 120, 120, 120, 121, 121, 121, 122,
+ 123, 123, 124, 124, 124, 124, 124, 124, 124, 124,
+ 124, 124, 125, 125, 126, 126, 127, 127, 127, 128,
+ 128, 128, 128, 128, 128, 128, 128, 128, 129, 129,
+ 130, 130, 130, 130, 130, 130, 131, 131, 131, 131,
+ 131, 131, 132, 132, 133, 134, 135, 136, 137, 138,
+ 139, 140, 140, 140, 140, 141, 142, 143, 143, 143,
+
+ 143, 143, 143, 144, 144, 144, 144, 145, 145, 146,
+ 146, 146, 146, 147, 148, 149, 149, 150, 150, 151,
+ 151, 151, 152, 152, 153, 154, 155, 155, 156, 157,
+ 158, 159, 159, 159, 160, 161, 162, 163, 163, 163,
+ 163, 163, 164, 165, 165, 165, 165, 165, 165, 165,
+ 165, 165, 165, 165, 165, 166, 167, 167, 167, 168,
+ 169, 169, 169, 169, 170, 170, 171, 171, 171, 171,
+ 171, 171, 171, 171, 171, 171, 171, 171, 171, 171,
+ 171, 172, 172, 173, 173, 173, 173, 173, 173, 174,
+ 174, 175, 175, 176, 176, 177, 177
+
+ } ;
+
+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[402] =
+ { 0,
+ 0, 0, 834, 835, 835, 835, 829, 820, 34, 36,
+ 38, 42, 46, 50, 0, 51, 54, 53, 56, 61,
+ 76, 77, 79, 80, 82, 83, 84, 90, 31, 111,
+ 94, 140, 113, 55, 110, 116, 827, 835, 818, 835,
+ 0, 128, 131, 144, 150, 124, 160, 167, 172, 0,
+ 136, 89, 168, 100, 41, 145, 114, 817, 139, 183,
+ 184, 185, 173, 186, 187, 189, 191, 133, 188, 193,
+ 200, 202, 194, 203, 205, 215, 208, 211, 207, 214,
+ 57, 816, 224, 225, 227, 231, 233, 234, 241, 235,
+ 236, 239, 247, 815, 251, 244, 245, 248, 254, 266,
+
+ 255, 276, 269, 278, 270, 277, 814, 0, 287, 291,
+ 813, 303, 309, 0, 812, 295, 811, 288, 310, 810,
+ 296, 299, 315, 809, 316, 317, 318, 319, 808, 240,
+ 322, 320, 321, 325, 326, 327, 328, 331, 336, 341,
+ 343, 344, 345, 346, 348, 350, 353, 351, 807, 806,
+ 355, 357, 805, 359, 804, 803, 380, 361, 363, 391,
+ 802, 373, 801, 374, 800, 369, 365, 393, 396, 398,
+ 401, 397, 399, 409, 403, 411, 405, 368, 413, 416,
+ 417, 418, 367, 419, 423, 799, 425, 835, 431, 437,
+ 443, 446, 449, 450, 439, 451, 798, 797, 796, 452,
+
+ 453, 455, 454, 458, 461, 462, 463, 465, 464, 469,
+ 795, 470, 472, 478, 475, 479, 480, 482, 483, 794,
+ 793, 486, 792, 488, 490, 0, 494, 499, 489, 501,
+ 502, 505, 497, 507, 508, 791, 517, 518, 790, 789,
+ 519, 788, 521, 527, 522, 529, 523, 530, 531, 536,
+ 538, 787, 539, 786, 541, 544, 544, 545, 785, 548,
+ 556, 546, 557, 550, 558, 560, 564, 784, 566, 783,
+ 568, 569, 570, 571, 576, 782, 572, 578, 590, 582,
+ 592, 781, 579, 780, 779, 778, 777, 776, 775, 774,
+ 773, 593, 580, 595, 772, 771, 770, 594, 599, 600,
+
+ 596, 598, 769, 607, 610, 611, 768, 612, 767, 614,
+ 613, 615, 766, 765, 764, 616, 763, 618, 762, 620,
+ 627, 761, 626, 760, 759, 758, 624, 757, 756, 755,
+ 754, 635, 638, 753, 752, 749, 739, 636, 639, 640,
+ 641, 738, 737, 643, 644, 642, 646, 647, 649, 655,
+ 662, 654, 665, 666, 736, 735, 668, 669, 734, 733,
+ 670, 672, 673, 732, 676, 731, 674, 675, 678, 681,
+ 684, 686, 682, 690, 693, 695, 696, 700, 698, 703,
+ 730, 708, 728, 706, 704, 709, 710, 711, 726, 712,
+ 722, 714, 574, 720, 491, 835, 753, 755, 280, 759,
+
+ 161
+ } ;
+
+static yyconst short int yy_def[402] =
+ { 0,
+ 396, 1, 396, 396, 396, 396, 397, 398, 399, 396,
+ 398, 398, 398, 398, 400, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 397, 396, 398, 396,
+ 401, 401, 396, 396, 398, 398, 398, 398, 398, 400,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+
+ 398, 398, 398, 398, 398, 398, 396, 401, 401, 396,
+ 398, 398, 398, 49, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 49, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 396, 396, 396,
+ 396, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 157, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 396, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 398, 398, 398, 398, 398,
+ 398, 398, 398, 398, 398, 0, 396, 396, 396, 396,
+
+ 396
+ } ;
+
+static yyconst short int yy_nxt[877] =
+ { 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, 85, 40, 40, 47, 48, 48, 40, 47, 48,
+ 48, 40, 40, 119, 40, 40, 40, 40, 40, 59,
+ 51, 60, 40, 152, 55, 104, 62, 52, 56, 53,
+ 63, 54, 61, 57, 49, 64, 58, 40, 40, 65,
+ 40, 40, 67, 40, 40, 40, 74, 70, 77, 66,
+
+ 40, 40, 68, 71, 75, 40, 72, 73, 69, 76,
+ 93, 40, 79, 83, 81, 116, 82, 78, 80, 84,
+ 86, 40, 40, 94, 40, 40, 95, 40, 87, 102,
+ 118, 88, 111, 96, 89, 40, 106, 109, 109, 105,
+ 43, 43, 103, 121, 40, 90, 91, 40, 92, 86,
+ 40, 40, 110, 44, 44, 115, 40, 97, 47, 45,
+ 45, 40, 136, 108, 98, 122, 99, 120, 100, 112,
+ 112, 40, 123, 101, 113, 47, 48, 48, 40, 40,
+ 113, 114, 114, 40, 40, 114, 114, 117, 114, 114,
+ 114, 114, 114, 114, 40, 40, 40, 40, 40, 40,
+
+ 40, 124, 40, 127, 40, 40, 131, 132, 137, 129,
+ 125, 40, 126, 40, 40, 128, 40, 134, 40, 40,
+ 143, 130, 40, 133, 135, 40, 40, 138, 141, 139,
+ 142, 146, 140, 144, 148, 40, 40, 149, 40, 145,
+ 151, 150, 40, 147, 40, 40, 40, 40, 153, 154,
+ 40, 40, 40, 165, 155, 40, 40, 204, 40, 40,
+ 159, 156, 40, 166, 164, 40, 40, 161, 160, 157,
+ 162, 167, 158, 163, 171, 169, 173, 40, 179, 168,
+ 40, 40, 41, 174, 172, 175, 170, 40, 40, 40,
+ 176, 180, 181, 183, 185, 184, 109, 109, 177, 40,
+
+ 189, 189, 186, 178, 182, 190, 40, 40, 195, 187,
+ 40, 190, 112, 112, 40, 191, 192, 113, 193, 193,
+ 40, 40, 197, 113, 194, 198, 40, 40, 40, 40,
+ 40, 40, 40, 40, 196, 200, 40, 40, 40, 40,
+ 206, 207, 40, 210, 202, 203, 205, 40, 211, 199,
+ 201, 212, 40, 213, 40, 40, 40, 40, 208, 40,
+ 209, 40, 40, 215, 40, 217, 40, 214, 40, 220,
+ 40, 218, 40, 216, 40, 221, 40, 222, 40, 40,
+ 40, 223, 219, 228, 40, 40, 252, 225, 224, 226,
+ 226, 236, 247, 226, 226, 227, 226, 226, 226, 226,
+
+ 226, 226, 40, 235, 40, 233, 234, 40, 40, 40,
+ 40, 229, 40, 230, 40, 237, 40, 231, 239, 232,
+ 40, 240, 40, 244, 40, 246, 238, 40, 40, 40,
+ 40, 241, 249, 242, 40, 253, 40, 243, 251, 245,
+ 189, 189, 248, 191, 191, 190, 256, 256, 254, 250,
+ 40, 190, 256, 256, 255, 193, 193, 40, 193, 193,
+ 40, 40, 40, 40, 40, 40, 40, 258, 257, 40,
+ 260, 262, 40, 40, 40, 40, 40, 265, 263, 259,
+ 40, 40, 269, 40, 264, 268, 40, 261, 272, 40,
+ 40, 40, 266, 40, 40, 267, 271, 40, 273, 40,
+
+ 40, 40, 40, 270, 275, 40, 276, 274, 40, 278,
+ 40, 277, 40, 40, 282, 279, 40, 283, 40, 40,
+ 284, 285, 287, 280, 281, 289, 292, 291, 40, 40,
+ 40, 290, 40, 40, 40, 286, 288, 293, 40, 295,
+ 40, 40, 40, 296, 294, 299, 298, 40, 297, 40,
+ 40, 300, 40, 256, 256, 40, 40, 40, 303, 40,
+ 307, 40, 301, 302, 308, 306, 309, 40, 40, 40,
+ 313, 40, 310, 305, 312, 40, 304, 40, 311, 40,
+ 40, 40, 40, 40, 317, 40, 314, 40, 318, 40,
+ 40, 40, 316, 40, 315, 319, 322, 320, 324, 321,
+
+ 323, 40, 326, 40, 40, 40, 40, 40, 325, 40,
+ 40, 40, 327, 328, 330, 331, 329, 333, 40, 334,
+ 336, 40, 40, 40, 40, 40, 40, 40, 332, 40,
+ 335, 40, 344, 342, 338, 40, 340, 40, 40, 339,
+ 346, 337, 341, 347, 348, 345, 40, 40, 343, 40,
+ 40, 40, 40, 40, 40, 40, 349, 40, 40, 350,
+ 40, 351, 352, 353, 357, 40, 40, 360, 354, 356,
+ 358, 362, 359, 40, 364, 355, 40, 40, 363, 40,
+ 40, 40, 361, 40, 40, 40, 40, 40, 366, 40,
+ 371, 374, 40, 40, 369, 40, 367, 40, 370, 365,
+
+ 372, 40, 378, 368, 40, 376, 40, 40, 373, 40,
+ 377, 40, 379, 381, 40, 40, 383, 40, 375, 40,
+ 40, 40, 40, 40, 380, 40, 384, 386, 387, 391,
+ 388, 40, 385, 40, 394, 382, 389, 40, 390, 40,
+ 393, 40, 40, 40, 40, 40, 40, 40, 40, 40,
+ 40, 392, 395, 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, 188, 40, 40, 40, 40,
+ 107, 40, 38, 396, 3, 396, 396, 396, 396, 396,
+ 396, 396, 396, 396, 396, 396, 396, 396, 396, 396,
+ 396, 396, 396, 396, 396, 396, 396, 396, 396, 396,
+ 396, 396, 396, 396, 396, 396, 396, 396, 396, 396,
+ 396, 396, 396, 396, 396, 396
+ } ;
+
+static yyconst short int yy_chk[877] =
+ { 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, 29, 9, 9, 10, 10, 11, 11, 11,
+ 12, 29, 55, 12, 13, 13, 13, 13, 14, 14,
+ 14, 14, 16, 55, 18, 17, 34, 19, 81, 18,
+ 16, 18, 20, 81, 17, 34, 19, 16, 17, 16,
+ 19, 16, 18, 17, 13, 19, 17, 21, 22, 20,
+ 23, 24, 21, 25, 26, 27, 24, 22, 25, 20,
+
+ 52, 28, 21, 22, 24, 31, 23, 23, 21, 24,
+ 31, 54, 26, 28, 27, 52, 27, 25, 26, 28,
+ 30, 35, 30, 31, 33, 57, 31, 36, 30, 33,
+ 54, 30, 46, 31, 30, 46, 36, 42, 42, 35,
+ 43, 43, 33, 57, 68, 30, 30, 51, 30, 32,
+ 59, 32, 44, 44, 44, 51, 56, 32, 45, 45,
+ 45, 45, 68, 401, 32, 59, 32, 56, 32, 47,
+ 47, 47, 59, 32, 47, 48, 48, 48, 48, 53,
+ 47, 49, 49, 49, 63, 49, 49, 53, 49, 49,
+ 49, 49, 49, 49, 60, 61, 62, 64, 65, 69,
+
+ 66, 60, 67, 62, 70, 73, 65, 66, 69, 63,
+ 61, 71, 61, 72, 74, 62, 75, 67, 79, 77,
+ 74, 64, 78, 66, 67, 80, 76, 70, 73, 71,
+ 73, 76, 72, 75, 77, 83, 84, 78, 85, 75,
+ 80, 79, 86, 76, 87, 88, 90, 91, 83, 84,
+ 92, 130, 89, 91, 85, 96, 97, 130, 93, 98,
+ 88, 85, 95, 92, 90, 99, 101, 89, 88, 86,
+ 89, 93, 87, 89, 96, 95, 98, 100, 101, 93,
+ 103, 105, 399, 99, 97, 100, 95, 102, 106, 104,
+ 100, 102, 102, 103, 104, 103, 109, 109, 100, 118,
+
+ 110, 110, 105, 100, 102, 110, 116, 121, 118, 106,
+ 122, 110, 112, 112, 112, 113, 113, 112, 113, 113,
+ 113, 119, 121, 112, 116, 122, 123, 125, 126, 127,
+ 128, 132, 133, 131, 119, 125, 134, 135, 136, 137,
+ 132, 133, 138, 136, 127, 128, 131, 139, 137, 123,
+ 126, 138, 140, 139, 141, 142, 143, 144, 134, 145,
+ 135, 146, 148, 141, 147, 143, 151, 140, 152, 146,
+ 154, 144, 158, 142, 159, 147, 167, 148, 183, 178,
+ 166, 151, 145, 159, 162, 164, 183, 154, 152, 157,
+ 157, 167, 178, 157, 157, 158, 157, 157, 157, 157,
+
+ 157, 157, 160, 166, 168, 162, 164, 169, 172, 170,
+ 173, 160, 171, 160, 175, 168, 177, 160, 170, 160,
+ 174, 171, 176, 175, 179, 177, 169, 180, 181, 182,
+ 184, 172, 180, 173, 185, 184, 187, 174, 182, 176,
+ 189, 189, 179, 190, 190, 189, 190, 190, 185, 181,
+ 195, 189, 191, 191, 187, 192, 192, 192, 193, 193,
+ 193, 194, 196, 200, 201, 203, 202, 195, 194, 204,
+ 200, 202, 205, 206, 207, 209, 208, 205, 203, 196,
+ 210, 212, 209, 213, 204, 208, 215, 201, 213, 214,
+ 216, 217, 206, 218, 219, 207, 212, 222, 214, 224,
+
+ 229, 225, 395, 210, 216, 227, 217, 215, 233, 219,
+ 228, 218, 230, 231, 227, 222, 232, 228, 234, 235,
+ 229, 230, 231, 224, 225, 232, 235, 234, 237, 238,
+ 241, 233, 243, 245, 247, 230, 231, 237, 244, 241,
+ 246, 248, 249, 243, 238, 246, 245, 250, 244, 251,
+ 253, 247, 255, 256, 256, 257, 258, 262, 250, 260,
+ 257, 264, 248, 249, 258, 255, 260, 261, 263, 265,
+ 264, 266, 261, 253, 263, 267, 251, 269, 262, 271,
+ 272, 273, 274, 277, 269, 393, 265, 275, 271, 278,
+ 283, 293, 267, 280, 266, 272, 275, 273, 278, 274,
+
+ 277, 279, 280, 281, 292, 298, 294, 301, 279, 302,
+ 299, 300, 281, 283, 293, 294, 292, 299, 304, 300,
+ 302, 305, 306, 308, 311, 310, 312, 316, 298, 318,
+ 301, 320, 316, 311, 305, 327, 308, 323, 321, 306,
+ 320, 304, 310, 321, 323, 318, 332, 338, 312, 333,
+ 339, 340, 341, 346, 344, 345, 327, 347, 348, 332,
+ 349, 333, 338, 339, 345, 352, 350, 348, 340, 344,
+ 346, 350, 347, 351, 352, 341, 353, 354, 351, 357,
+ 358, 361, 349, 362, 363, 367, 368, 365, 354, 369,
+ 363, 368, 370, 373, 361, 371, 357, 372, 362, 353,
+
+ 365, 374, 372, 358, 375, 370, 376, 377, 367, 379,
+ 371, 378, 373, 375, 380, 385, 377, 384, 369, 382,
+ 386, 387, 388, 390, 374, 392, 378, 380, 382, 387,
+ 384, 394, 379, 391, 392, 376, 385, 389, 386, 383,
+ 390, 381, 366, 364, 360, 359, 356, 355, 343, 342,
+ 337, 388, 394, 397, 397, 397, 397, 398, 398, 400,
+ 336, 400, 400, 335, 334, 331, 330, 329, 328, 326,
+ 325, 324, 322, 319, 317, 315, 314, 313, 309, 307,
+ 303, 297, 296, 295, 291, 290, 289, 288, 287, 286,
+ 285, 284, 282, 276, 270, 268, 259, 254, 252, 242,
+
+ 240, 239, 236, 223, 221, 220, 211, 199, 198, 197,
+ 186, 165, 163, 161, 156, 155, 153, 150, 149, 129,
+ 124, 120, 117, 115, 111, 107, 94, 82, 58, 39,
+ 37, 8, 7, 3, 396, 396, 396, 396, 396, 396,
+ 396, 396, 396, 396, 396, 396, 396, 396, 396, 396,
+ 396, 396, 396, 396, 396, 396, 396, 396, 396, 396,
+ 396, 396, 396, 396, 396, 396, 396, 396, 396, 396,
+ 396, 396, 396, 396, 396, 396
+ } ;
+
+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 "/proj/llvm/build/../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 "/proj/llvm/build/../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 879 "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 = NULL, *yy_bp = NULL;
+ register int yy_act;
+
+#line 179 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+
+
+#line 1033 "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 >= 397 )
+ 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 != 396 );
+
+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 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ /* Ignore comments for now */ }
+ YY_BREAK
+case 2:
+YY_RULE_SETUP
+#line 183 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return BEGINTOK; }
+ YY_BREAK
+case 3:
+YY_RULE_SETUP
+#line 184 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return ENDTOK; }
+ YY_BREAK
+case 4:
+YY_RULE_SETUP
+#line 185 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return TRUETOK; }
+ YY_BREAK
+case 5:
+YY_RULE_SETUP
+#line 186 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return FALSETOK; }
+ YY_BREAK
+case 6:
+YY_RULE_SETUP
+#line 187 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return DECLARE; }
+ YY_BREAK
+case 7:
+YY_RULE_SETUP
+#line 188 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return GLOBAL; }
+ YY_BREAK
+case 8:
+YY_RULE_SETUP
+#line 189 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return CONSTANT; }
+ YY_BREAK
+case 9:
+YY_RULE_SETUP
+#line 190 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return INTERNAL; }
+ YY_BREAK
+case 10:
+YY_RULE_SETUP
+#line 191 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return LINKONCE; }
+ YY_BREAK
+case 11:
+YY_RULE_SETUP
+#line 192 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return WEAK; }
+ YY_BREAK
+case 12:
+YY_RULE_SETUP
+#line 193 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return APPENDING; }
+ YY_BREAK
+case 13:
+YY_RULE_SETUP
+#line 194 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return EXTERNAL; } /* Deprecated, turn into external */
+ YY_BREAK
+case 14:
+YY_RULE_SETUP
+#line 195 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return EXTERNAL; }
+ YY_BREAK
+case 15:
+YY_RULE_SETUP
+#line 196 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return IMPLEMENTATION; }
+ YY_BREAK
+case 16:
+YY_RULE_SETUP
+#line 197 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return ZEROINITIALIZER; }
+ YY_BREAK
+case 17:
+YY_RULE_SETUP
+#line 198 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return DOTDOTDOT; }
+ YY_BREAK
+case 18:
+YY_RULE_SETUP
+#line 199 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return UNDEF; }
+ YY_BREAK
+case 19:
+YY_RULE_SETUP
+#line 200 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return NULL_TOK; }
+ YY_BREAK
+case 20:
+YY_RULE_SETUP
+#line 201 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return TO; }
+ YY_BREAK
+case 21:
+YY_RULE_SETUP
+#line 202 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(TermOpVal, Unwind, UNWIND); }
+ YY_BREAK
+case 22:
+YY_RULE_SETUP
+#line 203 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return NOT; } /* Deprecated, turned into XOR */
+ YY_BREAK
+case 23:
+YY_RULE_SETUP
+#line 204 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return TAIL; }
+ YY_BREAK
+case 24:
+YY_RULE_SETUP
+#line 205 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return TARGET; }
+ YY_BREAK
+case 25:
+YY_RULE_SETUP
+#line 206 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return TRIPLE; }
+ YY_BREAK
+case 26:
+YY_RULE_SETUP
+#line 207 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return DEPLIBS; }
+ YY_BREAK
+case 27:
+YY_RULE_SETUP
+#line 208 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return ENDIAN; }
+ YY_BREAK
+case 28:
+YY_RULE_SETUP
+#line 209 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return POINTERSIZE; }
+ YY_BREAK
+case 29:
+YY_RULE_SETUP
+#line 210 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return LITTLE; }
+ YY_BREAK
+case 30:
+YY_RULE_SETUP
+#line 211 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return BIG; }
+ YY_BREAK
+case 31:
+YY_RULE_SETUP
+#line 212 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return VOLATILE; }
+ YY_BREAK
+case 32:
+YY_RULE_SETUP
+#line 214 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return CC_TOK; }
+ YY_BREAK
+case 33:
+YY_RULE_SETUP
+#line 215 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return CCC_TOK; }
+ YY_BREAK
+case 34:
+YY_RULE_SETUP
+#line 216 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return FASTCC_TOK; }
+ YY_BREAK
+case 35:
+YY_RULE_SETUP
+#line 217 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return COLDCC_TOK; }
+ YY_BREAK
+case 36:
+YY_RULE_SETUP
+#line 219 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.PrimType = Type::VoidTy ; return VOID; }
+ YY_BREAK
+case 37:
+YY_RULE_SETUP
+#line 220 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.PrimType = Type::BoolTy ; return BOOL; }
+ YY_BREAK
+case 38:
+YY_RULE_SETUP
+#line 221 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.PrimType = Type::SByteTy ; return SBYTE; }
+ YY_BREAK
+case 39:
+YY_RULE_SETUP
+#line 222 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.PrimType = Type::UByteTy ; return UBYTE; }
+ YY_BREAK
+case 40:
+YY_RULE_SETUP
+#line 223 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.PrimType = Type::ShortTy ; return SHORT; }
+ YY_BREAK
+case 41:
+YY_RULE_SETUP
+#line 224 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.PrimType = Type::UShortTy; return USHORT; }
+ YY_BREAK
+case 42:
+YY_RULE_SETUP
+#line 225 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.PrimType = Type::IntTy ; return INT; }
+ YY_BREAK
+case 43:
+YY_RULE_SETUP
+#line 226 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.PrimType = Type::UIntTy ; return UINT; }
+ YY_BREAK
+case 44:
+YY_RULE_SETUP
+#line 227 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.PrimType = Type::LongTy ; return LONG; }
+ YY_BREAK
+case 45:
+YY_RULE_SETUP
+#line 228 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.PrimType = Type::ULongTy ; return ULONG; }
+ YY_BREAK
+case 46:
+YY_RULE_SETUP
+#line 229 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.PrimType = Type::FloatTy ; return FLOAT; }
+ YY_BREAK
+case 47:
+YY_RULE_SETUP
+#line 230 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.PrimType = Type::DoubleTy; return DOUBLE; }
+ YY_BREAK
+case 48:
+YY_RULE_SETUP
+#line 231 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.PrimType = Type::LabelTy ; return LABEL; }
+ YY_BREAK
+case 49:
+YY_RULE_SETUP
+#line 232 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return TYPE; }
+ YY_BREAK
+case 50:
+YY_RULE_SETUP
+#line 233 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return OPAQUE; }
+ YY_BREAK
+case 51:
+YY_RULE_SETUP
+#line 235 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, Add, ADD); }
+ YY_BREAK
+case 52:
+YY_RULE_SETUP
+#line 236 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, Sub, SUB); }
+ YY_BREAK
+case 53:
+YY_RULE_SETUP
+#line 237 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, Mul, MUL); }
+ YY_BREAK
+case 54:
+YY_RULE_SETUP
+#line 238 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, Div, DIV); }
+ YY_BREAK
+case 55:
+YY_RULE_SETUP
+#line 239 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, Rem, REM); }
+ YY_BREAK
+case 56:
+YY_RULE_SETUP
+#line 240 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, And, AND); }
+ YY_BREAK
+case 57:
+YY_RULE_SETUP
+#line 241 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, Or , OR ); }
+ YY_BREAK
+case 58:
+YY_RULE_SETUP
+#line 242 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, Xor, XOR); }
+ YY_BREAK
+case 59:
+YY_RULE_SETUP
+#line 243 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, SetNE, SETNE); }
+ YY_BREAK
+case 60:
+YY_RULE_SETUP
+#line 244 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, SetEQ, SETEQ); }
+ YY_BREAK
+case 61:
+YY_RULE_SETUP
+#line 245 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, SetLT, SETLT); }
+ YY_BREAK
+case 62:
+YY_RULE_SETUP
+#line 246 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, SetGT, SETGT); }
+ YY_BREAK
+case 63:
+YY_RULE_SETUP
+#line 247 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, SetLE, SETLE); }
+ YY_BREAK
+case 64:
+YY_RULE_SETUP
+#line 248 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(BinaryOpVal, SetGE, SETGE); }
+ YY_BREAK
+case 65:
+YY_RULE_SETUP
+#line 250 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(OtherOpVal, PHI, PHI_TOK); }
+ YY_BREAK
+case 66:
+YY_RULE_SETUP
+#line 251 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(OtherOpVal, Call, CALL); }
+ YY_BREAK
+case 67:
+YY_RULE_SETUP
+#line 252 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(OtherOpVal, Cast, CAST); }
+ YY_BREAK
+case 68:
+YY_RULE_SETUP
+#line 253 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(OtherOpVal, Select, SELECT); }
+ YY_BREAK
+case 69:
+YY_RULE_SETUP
+#line 254 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(OtherOpVal, Shl, SHL); }
+ YY_BREAK
+case 70:
+YY_RULE_SETUP
+#line 255 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(OtherOpVal, Shr, SHR); }
+ YY_BREAK
+case 71:
+YY_RULE_SETUP
+#line 256 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return VANEXT_old; }
+ YY_BREAK
+case 72:
+YY_RULE_SETUP
+#line 257 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return VAARG_old; }
+ YY_BREAK
+case 73:
+YY_RULE_SETUP
+#line 258 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(OtherOpVal, VAArg , VAARG); }
+ YY_BREAK
+case 74:
+YY_RULE_SETUP
+#line 259 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(TermOpVal, Ret, RET); }
+ YY_BREAK
+case 75:
+YY_RULE_SETUP
+#line 260 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(TermOpVal, Br, BR); }
+ YY_BREAK
+case 76:
+YY_RULE_SETUP
+#line 261 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(TermOpVal, Switch, SWITCH); }
+ YY_BREAK
+case 77:
+YY_RULE_SETUP
+#line 262 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(TermOpVal, Invoke, INVOKE); }
+ YY_BREAK
+case 78:
+YY_RULE_SETUP
+#line 263 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(TermOpVal, Unwind, UNWIND); }
+ YY_BREAK
+case 79:
+YY_RULE_SETUP
+#line 264 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(TermOpVal, Unreachable, UNREACHABLE); }
+ YY_BREAK
+case 80:
+YY_RULE_SETUP
+#line 266 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(MemOpVal, Malloc, MALLOC); }
+ YY_BREAK
+case 81:
+YY_RULE_SETUP
+#line 267 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(MemOpVal, Alloca, ALLOCA); }
+ YY_BREAK
+case 82:
+YY_RULE_SETUP
+#line 268 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(MemOpVal, Free, FREE); }
+ YY_BREAK
+case 83:
+YY_RULE_SETUP
+#line 269 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(MemOpVal, Load, LOAD); }
+ YY_BREAK
+case 84:
+YY_RULE_SETUP
+#line 270 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(MemOpVal, Store, STORE); }
+ YY_BREAK
+case 85:
+YY_RULE_SETUP
+#line 271 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ RET_TOK(MemOpVal, GetElementPtr, GETELEMENTPTR); }
+ YY_BREAK
+case 86:
+YY_RULE_SETUP
+#line 274 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{
+ UnEscapeLexed(yytext+1);
+ llvmAsmlval.StrVal = strdup(yytext+1); // Skip %
+ return VAR_ID;
+ }
+ YY_BREAK
+case 87:
+YY_RULE_SETUP
+#line 279 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{
+ yytext[strlen(yytext)-1] = 0; // nuke colon
+ UnEscapeLexed(yytext);
+ llvmAsmlval.StrVal = strdup(yytext);
+ return LABELSTR;
+ }
+ YY_BREAK
+case 88:
+YY_RULE_SETUP
+#line 285 "/proj/llvm/build/../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 89:
+YY_RULE_SETUP
+#line 292 "/proj/llvm/build/../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 90:
+YY_RULE_SETUP
+#line 303 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.UInt64Val = atoull(yytext); return EUINT64VAL; }
+ YY_BREAK
+case 91:
+YY_RULE_SETUP
+#line 304 "/proj/llvm/build/../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 92:
+YY_RULE_SETUP
+#line 312 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{
+ llvmAsmlval.UInt64Val = HexIntToVal(yytext+3);
+ return yytext[0] == 's' ? ESINT64VAL : EUINT64VAL;
+ }
+ YY_BREAK
+case 93:
+YY_RULE_SETUP
+#line 317 "/proj/llvm/build/../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 94:
+YY_RULE_SETUP
+#line 324 "/proj/llvm/build/../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 95:
+YY_RULE_SETUP
+#line 333 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.FPVal = atof(yytext); return FPVAL; }
+ YY_BREAK
+case 96:
+YY_RULE_SETUP
+#line 334 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ llvmAsmlval.FPVal = HexToFP(yytext); return FPVAL; }
+ YY_BREAK
+case YY_STATE_EOF(INITIAL):
+#line 336 "/proj/llvm/build/../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 97:
+YY_RULE_SETUP
+#line 344 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ /* Ignore whitespace */ }
+ YY_BREAK
+case 98:
+YY_RULE_SETUP
+#line 345 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+{ return yytext[0]; }
+ YY_BREAK
+case 99:
+YY_RULE_SETUP
+#line 347 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+YY_FATAL_ERROR( "flex scanner jammed" );
+ YY_BREAK
+#line 1674 "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 >= 397 )
+ 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 >= 397 )
+ 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 == 396);
+ 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 */
+
+
+#ifndef YY_NO_INPUT
+#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;
+ }
+#endif /* YY_NO_INPUT */
+
+#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 );
+ }
+
+
+
+#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 347 "/proj/llvm/build/../llvm/lib/AsmParser/Lexer.l"
+
Index: llvm/lib/AsmParser/llvmAsmParser.cpp
diff -u /dev/null llvm/lib/AsmParser/llvmAsmParser.cpp:1.17
--- /dev/null Sat Aug 27 13:50:52 2005
+++ llvm/lib/AsmParser/llvmAsmParser.cpp Sat Aug 27 13:50:38 2005
@@ -0,0 +1,4590 @@
+/* A Bison parser, made by GNU Bison 1.875c. */
+
+/* Skeleton parser for Yacc-like parsing with Bison,
+ Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
+
+ This program is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2, or (at your option)
+ any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 59 Temple Place - Suite 330,
+ Boston, MA 02111-1307, USA. */
+
+/* As a special exception, when this file is copied by Bison into a
+ Bison output file, you may use that output file without restriction.
+ This special exception was added by the Free Software Foundation
+ in version 1.24 of Bison. */
+
+/* Written by Richard Stallman by simplifying the original so called
+ ``semantic'' parser. */
+
+/* All symbols defined below should begin with yy or YY, to avoid
+ infringing on user name space. This should be done even for local
+ variables, as they might otherwise be expanded by user macros.
+ There are some unavoidable exceptions within include files to
+ define necessary library symbols; they are noted "INFRINGES ON
+ USER NAME SPACE" below. */
+
+/* Identify Bison output. */
+#define YYBISON 1
+
+/* Skeleton name. */
+#define YYSKELETON_NAME "yacc.c"
+
+/* Pure parsers. */
+#define YYPURE 0
+
+/* Using locations. */
+#define YYLSP_NEEDED 0
+
+/* If NAME_PREFIX is specified substitute the variables and functions
+ names. */
+#define yyparse llvmAsmparse
+#define yylex llvmAsmlex
+#define yyerror llvmAsmerror
+#define yylval llvmAsmlval
+#define yychar llvmAsmchar
+#define yydebug llvmAsmdebug
+#define yynerrs llvmAsmnerrs
+
+
+/* Tokens. */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+ /* Put the tokens into the symbol table, so that GDB and other debuggers
+ know about them. */
+ enum yytokentype {
+ ESINT64VAL = 258,
+ EUINT64VAL = 259,
+ SINTVAL = 260,
+ UINTVAL = 261,
+ FPVAL = 262,
+ VOID = 263,
+ BOOL = 264,
+ SBYTE = 265,
+ UBYTE = 266,
+ SHORT = 267,
+ USHORT = 268,
+ INT = 269,
+ UINT = 270,
+ LONG = 271,
+ ULONG = 272,
+ FLOAT = 273,
+ DOUBLE = 274,
+ TYPE = 275,
+ LABEL = 276,
+ VAR_ID = 277,
+ LABELSTR = 278,
+ STRINGCONSTANT = 279,
+ IMPLEMENTATION = 280,
+ ZEROINITIALIZER = 281,
+ TRUETOK = 282,
+ FALSETOK = 283,
+ BEGINTOK = 284,
+ ENDTOK = 285,
+ DECLARE = 286,
+ GLOBAL = 287,
+ CONSTANT = 288,
+ VOLATILE = 289,
+ TO = 290,
+ DOTDOTDOT = 291,
+ NULL_TOK = 292,
+ UNDEF = 293,
+ CONST = 294,
+ INTERNAL = 295,
+ LINKONCE = 296,
+ WEAK = 297,
+ APPENDING = 298,
+ OPAQUE = 299,
+ NOT = 300,
+ EXTERNAL = 301,
+ TARGET = 302,
+ TRIPLE = 303,
+ ENDIAN = 304,
+ POINTERSIZE = 305,
+ LITTLE = 306,
+ BIG = 307,
+ DEPLIBS = 308,
+ CALL = 309,
+ TAIL = 310,
+ CC_TOK = 311,
+ CCC_TOK = 312,
+ FASTCC_TOK = 313,
+ COLDCC_TOK = 314,
+ RET = 315,
+ BR = 316,
+ SWITCH = 317,
+ INVOKE = 318,
+ UNWIND = 319,
+ UNREACHABLE = 320,
+ ADD = 321,
+ SUB = 322,
+ MUL = 323,
+ DIV = 324,
+ REM = 325,
+ AND = 326,
+ OR = 327,
+ XOR = 328,
+ SETLE = 329,
+ SETGE = 330,
+ SETLT = 331,
+ SETGT = 332,
+ SETEQ = 333,
+ SETNE = 334,
+ MALLOC = 335,
+ ALLOCA = 336,
+ FREE = 337,
+ LOAD = 338,
+ STORE = 339,
+ GETELEMENTPTR = 340,
+ PHI_TOK = 341,
+ CAST = 342,
+ SELECT = 343,
+ SHL = 344,
+ SHR = 345,
+ VAARG = 346,
+ VAARG_old = 347,
+ VANEXT_old = 348
+ };
+#endif
+#define ESINT64VAL 258
+#define EUINT64VAL 259
+#define SINTVAL 260
+#define UINTVAL 261
+#define FPVAL 262
+#define VOID 263
+#define BOOL 264
+#define SBYTE 265
+#define UBYTE 266
+#define SHORT 267
+#define USHORT 268
+#define INT 269
+#define UINT 270
+#define LONG 271
+#define ULONG 272
+#define FLOAT 273
+#define DOUBLE 274
+#define TYPE 275
+#define LABEL 276
+#define VAR_ID 277
+#define LABELSTR 278
+#define STRINGCONSTANT 279
+#define IMPLEMENTATION 280
+#define ZEROINITIALIZER 281
+#define TRUETOK 282
+#define FALSETOK 283
+#define BEGINTOK 284
+#define ENDTOK 285
+#define DECLARE 286
+#define GLOBAL 287
+#define CONSTANT 288
+#define VOLATILE 289
+#define TO 290
+#define DOTDOTDOT 291
+#define NULL_TOK 292
+#define UNDEF 293
+#define CONST 294
+#define INTERNAL 295
+#define LINKONCE 296
+#define WEAK 297
+#define APPENDING 298
+#define OPAQUE 299
+#define NOT 300
+#define EXTERNAL 301
+#define TARGET 302
+#define TRIPLE 303
+#define ENDIAN 304
+#define POINTERSIZE 305
+#define LITTLE 306
+#define BIG 307
+#define DEPLIBS 308
+#define CALL 309
+#define TAIL 310
+#define CC_TOK 311
+#define CCC_TOK 312
+#define FASTCC_TOK 313
+#define COLDCC_TOK 314
+#define RET 315
+#define BR 316
+#define SWITCH 317
+#define INVOKE 318
+#define UNWIND 319
+#define UNREACHABLE 320
+#define ADD 321
+#define SUB 322
+#define MUL 323
+#define DIV 324
+#define REM 325
+#define AND 326
+#define OR 327
+#define XOR 328
+#define SETLE 329
+#define SETGE 330
+#define SETLT 331
+#define SETGT 332
+#define SETEQ 333
+#define SETNE 334
+#define MALLOC 335
+#define ALLOCA 336
+#define FREE 337
+#define LOAD 338
+#define STORE 339
+#define GETELEMENTPTR 340
+#define PHI_TOK 341
+#define CAST 342
+#define SELECT 343
+#define SHL 344
+#define SHR 345
+#define VAARG 346
+#define VAARG_old 347
+#define VANEXT_old 348
+
+
+
+
+/* Copy the first part of user declarations. */
+#line 14 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+
+#include "ParserInternals.h"
+#include "llvm/CallingConv.h"
+#include "llvm/Instructions.h"
+#include "llvm/Module.h"
+#include "llvm/SymbolTable.h"
+#include "llvm/Support/GetElementPtrTypeIterator.h"
+#include "llvm/ADT/STLExtras.h"
+#include <algorithm>
+#include <iostream>
+#include <list>
+#include <utility>
+
+int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit
+int yylex(); // declaration" of xxx warnings.
+int yyparse();
+
+namespace llvm {
+ std::string CurFilename;
+}
+using namespace llvm;
+
+static Module *ParserResult;
+
+// DEBUG_UPREFS - Define this symbol if you want to enable debugging output
+// relating to upreferences in the input stream.
+//
+//#define DEBUG_UPREFS 1
+#ifdef DEBUG_UPREFS
+#define UR_OUT(X) std::cerr << X
+#else
+#define UR_OUT(X)
+#endif
+
+#define YYERROR_VERBOSE 1
+
+static bool ObsoleteVarArgs;
+static bool NewVarArgs;
+static BasicBlock* CurBB;
+
+
+// This contains info used when building the body of a function. It is
+// destroyed when the function is completed.
+//
+typedef std::vector<Value *> ValueList; // Numbered defs
+static void
+ResolveDefinitions(std::map<const Type *,ValueList> &LateResolvers,
+ std::map<const Type *,ValueList> *FutureLateResolvers = 0);
+
+static struct PerModuleInfo {
+ Module *CurrentModule;
+ std::map<const Type *, ValueList> Values; // Module level numbered definitions
+ std::map<const Type *,ValueList> LateResolveValues;
+ std::vector<PATypeHolder> Types;
+ std::map<ValID, PATypeHolder> LateResolveTypes;
+
+ /// PlaceHolderInfo - When temporary placeholder objects are created, remember
+ /// how they were referenced and one which line of the input they came from so
+ /// that we can resolve them later and print error messages as appropriate.
+ std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo;
+
+ // GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward
+ // references to global values. Global values may be referenced before they
+ // are defined, and if so, the temporary object that they represent is held
+ // here. This is used for forward references of GlobalValues.
+ //
+ typedef std::map<std::pair<const PointerType *,
+ ValID>, GlobalValue*> GlobalRefsType;
+ GlobalRefsType GlobalRefs;
+
+ void ModuleDone() {
+ // If we could not resolve some functions at function compilation time
+ // (calls to functions before they are defined), resolve them now... Types
+ // are resolved when the constant pool has been completely parsed.
+ //
+ ResolveDefinitions(LateResolveValues);
+
+ // Check to make sure that all global value forward references have been
+ // resolved!
+ //
+ if (!GlobalRefs.empty()) {
+ std::string UndefinedReferences = "Unresolved global references exist:\n";
+
+ for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
+ I != E; ++I) {
+ UndefinedReferences += " " + I->first.first->getDescription() + " " +
+ I->first.second.getName() + "\n";
+ }
+ ThrowException(UndefinedReferences);
+ }
+
+ Values.clear(); // Clear out function local definitions
+ Types.clear();
+ CurrentModule = 0;
+ }
+
+
+ // GetForwardRefForGlobal - Check to see if there is a forward reference
+ // for this global. If so, remove it from the GlobalRefs map and return it.
+ // If not, just return null.
+ GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) {
+ // Check to see if there is a forward reference to this global variable...
+ // if there is, eliminate it and patch the reference to use the new def'n.
+ GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID));
+ GlobalValue *Ret = 0;
+ if (I != GlobalRefs.end()) {
+ Ret = I->second;
+ GlobalRefs.erase(I);
+ }
+ return Ret;
+ }
+} CurModule;
+
+static struct PerFunctionInfo {
+ Function *CurrentFunction; // Pointer to current function being created
+
+ std::map<const Type*, ValueList> Values; // Keep track of #'d definitions
+ std::map<const Type*, ValueList> LateResolveValues;
+ bool isDeclare; // Is this function a forward declararation?
+
+ /// BBForwardRefs - When we see forward references to basic blocks, keep
+ /// track of them here.
+ std::map<BasicBlock*, std::pair<ValID, int> > BBForwardRefs;
+ std::vector<BasicBlock*> NumberedBlocks;
+ unsigned NextBBNum;
+
+ inline PerFunctionInfo() {
+ CurrentFunction = 0;
+ isDeclare = false;
+ }
+
+ inline void FunctionStart(Function *M) {
+ CurrentFunction = M;
+ NextBBNum = 0;
+ }
+
+ void FunctionDone() {
+ NumberedBlocks.clear();
+
+ // Any forward referenced blocks left?
+ if (!BBForwardRefs.empty())
+ ThrowException("Undefined reference to label " +
+ BBForwardRefs.begin()->first->getName());
+
+ // Resolve all forward references now.
+ ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
+
+ Values.clear(); // Clear out function local definitions
+ CurrentFunction = 0;
+ isDeclare = false;
+ }
+} CurFun; // Info for the current function...
+
+static bool inFunctionScope() { return CurFun.CurrentFunction != 0; }
+
+
+//===----------------------------------------------------------------------===//
+// Code to handle definitions of all the types
+//===----------------------------------------------------------------------===//
+
+static int InsertValue(Value *V,
+ std::map<const Type*,ValueList> &ValueTab = CurFun.Values) {
+ if (V->hasName()) return -1; // Is this a numbered definition?
+
+ // Yes, insert the value into the value table...
+ ValueList &List = ValueTab[V->getType()];
+ List.push_back(V);
+ return List.size()-1;
+}
+
+static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
+ switch (D.Type) {
+ case ValID::NumberVal: // Is it a numbered definition?
+ // Module constants occupy the lowest numbered slots...
+ if ((unsigned)D.Num < CurModule.Types.size())
+ return CurModule.Types[(unsigned)D.Num];
+ break;
+ case ValID::NameVal: // Is it a named definition?
+ if (const Type *N = CurModule.CurrentModule->getTypeByName(D.Name)) {
+ D.destroy(); // Free old strdup'd memory...
+ return N;
+ }
+ break;
+ default:
+ ThrowException("Internal parser error: Invalid symbol type reference!");
+ }
+
+ // If we reached here, we referenced either a symbol that we don't know about
+ // or an id number that hasn't been read yet. We may be referencing something
+ // forward, so just create an entry to be resolved later and get to it...
+ //
+ if (DoNotImprovise) return 0; // Do we just want a null to be returned?
+
+
+ if (inFunctionScope()) {
+ if (D.Type == ValID::NameVal)
+ ThrowException("Reference to an undefined type: '" + D.getName() + "'");
+ else
+ ThrowException("Reference to an undefined type: #" + itostr(D.Num));
+ }
+
+ std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D);
+ if (I != CurModule.LateResolveTypes.end())
+ return I->second;
+
+ Type *Typ = OpaqueType::get();
+ CurModule.LateResolveTypes.insert(std::make_pair(D, Typ));
+ return Typ;
+ }
+
+static Value *lookupInSymbolTable(const Type *Ty, const std::string &Name) {
+ SymbolTable &SymTab =
+ inFunctionScope() ? CurFun.CurrentFunction->getSymbolTable() :
+ CurModule.CurrentModule->getSymbolTable();
+ return SymTab.lookup(Ty, Name);
+}
+
+// getValNonImprovising - Look up the value specified by the provided type and
+// the provided ValID. If the value exists and has already been defined, return
+// it. Otherwise return null.
+//
+static Value *getValNonImprovising(const Type *Ty, const ValID &D) {
+ if (isa<FunctionType>(Ty))
+ ThrowException("Functions are not values and "
+ "must be referenced as pointers");
+
+ switch (D.Type) {
+ case ValID::NumberVal: { // Is it a numbered definition?
+ unsigned Num = (unsigned)D.Num;
+
+ // Module constants occupy the lowest numbered slots...
+ std::map<const Type*,ValueList>::iterator VI = CurModule.Values.find(Ty);
+ if (VI != CurModule.Values.end()) {
+ if (Num < VI->second.size())
+ return VI->second[Num];
+ Num -= VI->second.size();
+ }
+
+ // Make sure that our type is within bounds
+ VI = CurFun.Values.find(Ty);
+ if (VI == CurFun.Values.end()) return 0;
+
+ // Check that the number is within bounds...
+ if (VI->second.size() <= Num) return 0;
+
+ return VI->second[Num];
+ }
+
+ case ValID::NameVal: { // Is it a named definition?
+ Value *N = lookupInSymbolTable(Ty, std::string(D.Name));
+ if (N == 0) return 0;
+
+ D.destroy(); // Free old strdup'd memory...
+ return N;
+ }
+
+ // Check to make sure that "Ty" is an integral type, and that our
+ // value will fit into the specified type...
+ case ValID::ConstSIntVal: // Is it a constant pool reference??
+ if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64))
+ ThrowException("Signed integral constant '" +
+ itostr(D.ConstPool64) + "' is invalid for type '" +
+ Ty->getDescription() + "'!");
+ return ConstantSInt::get(Ty, D.ConstPool64);
+
+ case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
+ if (!ConstantUInt::isValueValidForType(Ty, D.UConstPool64)) {
+ if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64)) {
+ ThrowException("Integral constant '" + utostr(D.UConstPool64) +
+ "' is invalid or out of range!");
+ } else { // This is really a signed reference. Transmogrify.
+ return ConstantSInt::get(Ty, D.ConstPool64);
+ }
+ } else {
+ return ConstantUInt::get(Ty, D.UConstPool64);
+ }
+
+ case ValID::ConstFPVal: // Is it a floating point const pool reference?
+ if (!ConstantFP::isValueValidForType(Ty, D.ConstPoolFP))
+ ThrowException("FP constant invalid for type!!");
+ return ConstantFP::get(Ty, D.ConstPoolFP);
+
+ case ValID::ConstNullVal: // Is it a null value?
+ if (!isa<PointerType>(Ty))
+ ThrowException("Cannot create a a non pointer null!");
+ return ConstantPointerNull::get(cast<PointerType>(Ty));
+
+ case ValID::ConstUndefVal: // Is it an undef value?
+ return UndefValue::get(Ty);
+
+ case ValID::ConstantVal: // Fully resolved constant?
+ if (D.ConstantValue->getType() != Ty)
+ ThrowException("Constant expression type different from required type!");
+ return D.ConstantValue;
+
+ default:
+ assert(0 && "Unhandled case!");
+ return 0;
+ } // End of switch
+
+ assert(0 && "Unhandled case!");
+ return 0;
+}
+
+// getVal - This function is identical to getValNonImprovising, except that if a
+// value is not already defined, it "improvises" by creating a placeholder var
+// that looks and acts just like the requested variable. When the value is
+// defined later, all uses of the placeholder variable are replaced with the
+// real thing.
+//
+static Value *getVal(const Type *Ty, const ValID &ID) {
+ if (Ty == Type::LabelTy)
+ ThrowException("Cannot use a basic block here");
+
+ // See if the value has already been defined.
+ Value *V = getValNonImprovising(Ty, ID);
+ if (V) return V;
+
+ if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty))
+ ThrowException("Invalid use of a composite type!");
+
+ // If we reached here, we referenced either a symbol that we don't know about
+ // or an id number that hasn't been read yet. We may be referencing something
+ // forward, so just create an entry to be resolved later and get to it...
+ //
+ V = new Argument(Ty);
+
+ // Remember where this forward reference came from. FIXME, shouldn't we try
+ // to recycle these things??
+ CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID,
+ llvmAsmlineno)));
+
+ if (inFunctionScope())
+ InsertValue(V, CurFun.LateResolveValues);
+ else
+ InsertValue(V, CurModule.LateResolveValues);
+ return V;
+}
+
+/// getBBVal - This is used for two purposes:
+/// * If isDefinition is true, a new basic block with the specified ID is being
+/// defined.
+/// * If isDefinition is true, this is a reference to a basic block, which may
+/// or may not be a forward reference.
+///
+static BasicBlock *getBBVal(const ValID &ID, bool isDefinition = false) {
+ assert(inFunctionScope() && "Can't get basic block at global scope!");
+
+ std::string Name;
+ BasicBlock *BB = 0;
+ switch (ID.Type) {
+ default: ThrowException("Illegal label reference " + ID.getName());
+ case ValID::NumberVal: // Is it a numbered definition?
+ if (unsigned(ID.Num) >= CurFun.NumberedBlocks.size())
+ CurFun.NumberedBlocks.resize(ID.Num+1);
+ BB = CurFun.NumberedBlocks[ID.Num];
+ break;
+ case ValID::NameVal: // Is it a named definition?
+ Name = ID.Name;
+ if (Value *N = CurFun.CurrentFunction->
+ getSymbolTable().lookup(Type::LabelTy, Name))
+ BB = cast<BasicBlock>(N);
+ break;
+ }
+
+ // See if the block has already been defined.
+ if (BB) {
+ // If this is the definition of the block, make sure the existing value was
+ // just a forward reference. If it was a forward reference, there will be
+ // an entry for it in the PlaceHolderInfo map.
+ if (isDefinition && !CurFun.BBForwardRefs.erase(BB))
+ // The existing value was a definition, not a forward reference.
+ ThrowException("Redefinition of label " + ID.getName());
+
+ ID.destroy(); // Free strdup'd memory.
+ return BB;
+ }
+
+ // Otherwise this block has not been seen before.
+ BB = new BasicBlock("", CurFun.CurrentFunction);
+ if (ID.Type == ValID::NameVal) {
+ BB->setName(ID.Name);
+ } else {
+ CurFun.NumberedBlocks[ID.Num] = BB;
+ }
+
+ // If this is not a definition, keep track of it so we can use it as a forward
+ // reference.
+ if (!isDefinition) {
+ // Remember where this forward reference came from.
+ CurFun.BBForwardRefs[BB] = std::make_pair(ID, llvmAsmlineno);
+ } else {
+ // The forward declaration could have been inserted anywhere in the
+ // function: insert it into the correct place now.
+ CurFun.CurrentFunction->getBasicBlockList().remove(BB);
+ CurFun.CurrentFunction->getBasicBlockList().push_back(BB);
+ }
+ ID.destroy();
+ return BB;
+}
+
+
+//===----------------------------------------------------------------------===//
+// Code to handle forward references in instructions
+//===----------------------------------------------------------------------===//
+//
+// This code handles the late binding needed with statements that reference
+// values not defined yet... for example, a forward branch, or the PHI node for
+// a loop body.
+//
+// This keeps a table (CurFun.LateResolveValues) of all such forward references
+// and back patchs after we are done.
+//
+
+// ResolveDefinitions - If we could not resolve some defs at parsing
+// time (forward branches, phi functions for loops, etc...) resolve the
+// defs now...
+//
+static void
+ResolveDefinitions(std::map<const Type*,ValueList> &LateResolvers,
+ std::map<const Type*,ValueList> *FutureLateResolvers) {
+ // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
+ for (std::map<const Type*,ValueList>::iterator LRI = LateResolvers.begin(),
+ E = LateResolvers.end(); LRI != E; ++LRI) {
+ ValueList &List = LRI->second;
+ while (!List.empty()) {
+ Value *V = List.back();
+ List.pop_back();
+
+ std::map<Value*, std::pair<ValID, int> >::iterator PHI =
+ CurModule.PlaceHolderInfo.find(V);
+ assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
+
+ ValID &DID = PHI->second.first;
+
+ Value *TheRealValue = getValNonImprovising(LRI->first, DID);
+ if (TheRealValue) {
+ V->replaceAllUsesWith(TheRealValue);
+ delete V;
+ CurModule.PlaceHolderInfo.erase(PHI);
+ } else if (FutureLateResolvers) {
+ // Functions have their unresolved items forwarded to the module late
+ // resolver table
+ InsertValue(V, *FutureLateResolvers);
+ } else {
+ if (DID.Type == ValID::NameVal)
+ ThrowException("Reference to an invalid definition: '" +DID.getName()+
+ "' of type '" + V->getType()->getDescription() + "'",
+ PHI->second.second);
+ else
+ ThrowException("Reference to an invalid definition: #" +
+ itostr(DID.Num) + " of type '" +
+ V->getType()->getDescription() + "'",
+ PHI->second.second);
+ }
+ }
+ }
+
+ LateResolvers.clear();
+}
+
+// ResolveTypeTo - A brand new type was just declared. This means that (if
+// name is not null) things referencing Name can be resolved. Otherwise, things
+// refering to the number can be resolved. Do this now.
+//
+static void ResolveTypeTo(char *Name, const Type *ToTy) {
+ ValID D;
+ if (Name) D = ValID::create(Name);
+ else D = ValID::create((int)CurModule.Types.size());
+
+ std::map<ValID, PATypeHolder>::iterator I =
+ CurModule.LateResolveTypes.find(D);
+ if (I != CurModule.LateResolveTypes.end()) {
+ ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
+ CurModule.LateResolveTypes.erase(I);
+ }
+}
+
+// setValueName - Set the specified value to the name given. The name may be
+// null potentially, in which case this is a noop. The string passed in is
+// assumed to be a malloc'd string buffer, and is free'd by this function.
+//
+static void setValueName(Value *V, char *NameStr) {
+ if (NameStr) {
+ std::string Name(NameStr); // Copy string
+ free(NameStr); // Free old string
+
+ if (V->getType() == Type::VoidTy)
+ ThrowException("Can't assign name '" + Name+"' to value with void type!");
+
+ assert(inFunctionScope() && "Must be in function scope!");
+ SymbolTable &ST = CurFun.CurrentFunction->getSymbolTable();
+ if (ST.lookup(V->getType(), Name))
+ ThrowException("Redefinition of value named '" + Name + "' in the '" +
+ V->getType()->getDescription() + "' type plane!");
+
+ // Set the name.
+ V->setName(Name);
+ }
+}
+
+/// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
+/// this is a declaration, otherwise it is a definition.
+static void ParseGlobalVariable(char *NameStr,GlobalValue::LinkageTypes Linkage,
+ bool isConstantGlobal, const Type *Ty,
+ Constant *Initializer) {
+ if (isa<FunctionType>(Ty))
+ ThrowException("Cannot declare global vars of function type!");
+
+ const PointerType *PTy = PointerType::get(Ty);
+
+ std::string Name;
+ if (NameStr) {
+ Name = NameStr; // Copy string
+ free(NameStr); // Free old string
+ }
+
+ // See if this global value was forward referenced. If so, recycle the
+ // object.
+ ValID ID;
+ if (!Name.empty()) {
+ ID = ValID::create((char*)Name.c_str());
+ } else {
+ ID = ValID::create((int)CurModule.Values[PTy].size());
+ }
+
+ if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
+ // Move the global to the end of the list, from whereever it was
+ // previously inserted.
+ GlobalVariable *GV = cast<GlobalVariable>(FWGV);
+ CurModule.CurrentModule->getGlobalList().remove(GV);
+ CurModule.CurrentModule->getGlobalList().push_back(GV);
+ GV->setInitializer(Initializer);
+ GV->setLinkage(Linkage);
+ GV->setConstant(isConstantGlobal);
+ InsertValue(GV, CurModule.Values);
+ return;
+ }
+
+ // If this global has a name, check to see if there is already a definition
+ // of this global in the module. If so, merge as appropriate. Note that
+ // this is really just a hack around problems in the CFE. :(
+ if (!Name.empty()) {
+ // We are a simple redefinition of a value, check to see if it is defined
+ // the same as the old one.
+ if (GlobalVariable *EGV =
+ CurModule.CurrentModule->getGlobalVariable(Name, Ty)) {
+ // We are allowed to redefine a global variable in two circumstances:
+ // 1. If at least one of the globals is uninitialized or
+ // 2. If both initializers have the same value.
+ //
+ if (!EGV->hasInitializer() || !Initializer ||
+ EGV->getInitializer() == Initializer) {
+
+ // Make sure the existing global version gets the initializer! Make
+ // sure that it also gets marked const if the new version is.
+ if (Initializer && !EGV->hasInitializer())
+ EGV->setInitializer(Initializer);
+ if (isConstantGlobal)
+ EGV->setConstant(true);
+ EGV->setLinkage(Linkage);
+ return;
+ }
+
+ ThrowException("Redefinition of global variable named '" + Name +
+ "' in the '" + Ty->getDescription() + "' type plane!");
+ }
+ }
+
+ // Otherwise there is no existing GV to use, create one now.
+ GlobalVariable *GV =
+ new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
+ CurModule.CurrentModule);
+ InsertValue(GV, CurModule.Values);
+}
+
+// setTypeName - Set the specified type to the name given. The name may be
+// null potentially, in which case this is a noop. The string passed in is
+// assumed to be a malloc'd string buffer, and is freed by this function.
+//
+// This function returns true if the type has already been defined, but is
+// allowed to be redefined in the specified context. If the name is a new name
+// for the type plane, it is inserted and false is returned.
+static bool setTypeName(const Type *T, char *NameStr) {
+ assert(!inFunctionScope() && "Can't give types function-local names!");
+ if (NameStr == 0) return false;
+
+ std::string Name(NameStr); // Copy string
+ free(NameStr); // Free old string
+
+ // We don't allow assigning names to void type
+ if (T == Type::VoidTy)
+ ThrowException("Can't assign name '" + Name + "' to the void type!");
+
+ // Set the type name, checking for conflicts as we do so.
+ bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
+
+ if (AlreadyExists) { // Inserting a name that is already defined???
+ const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
+ assert(Existing && "Conflict but no matching type?");
+
+ // There is only one case where this is allowed: when we are refining an
+ // opaque type. In this case, Existing will be an opaque type.
+ if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
+ // We ARE replacing an opaque type!
+ const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
+ return true;
+ }
+
+ // Otherwise, this is an attempt to redefine a type. That's okay if
+ // the redefinition is identical to the original. This will be so if
+ // Existing and T point to the same Type object. In this one case we
+ // allow the equivalent redefinition.
+ if (Existing == T) return true; // Yes, it's equal.
+
+ // Any other kind of (non-equivalent) redefinition is an error.
+ ThrowException("Redefinition of type named '" + Name + "' in the '" +
+ T->getDescription() + "' type plane!");
+ }
+
+ return false;
+}
+
+//===----------------------------------------------------------------------===//
+// Code for handling upreferences in type names...
+//
+
+// TypeContains - Returns true if Ty directly contains E in it.
+//
+static bool TypeContains(const Type *Ty, const Type *E) {
+ return std::find(Ty->subtype_begin(), Ty->subtype_end(),
+ E) != Ty->subtype_end();
+}
+
+namespace {
+ struct UpRefRecord {
+ // NestingLevel - The number of nesting levels that need to be popped before
+ // this type is resolved.
+ unsigned NestingLevel;
+
+ // LastContainedTy - This is the type at the current binding level for the
+ // type. Every time we reduce the nesting level, this gets updated.
+ const Type *LastContainedTy;
+
+ // UpRefTy - This is the actual opaque type that the upreference is
+ // represented with.
+ OpaqueType *UpRefTy;
+
+ UpRefRecord(unsigned NL, OpaqueType *URTy)
+ : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
+ };
+}
+
+// UpRefs - A list of the outstanding upreferences that need to be resolved.
+static std::vector<UpRefRecord> UpRefs;
+
+/// HandleUpRefs - Every time we finish a new layer of types, this function is
+/// called. It loops through the UpRefs vector, which is a list of the
+/// currently active types. For each type, if the up reference is contained in
+/// the newly completed type, we decrement the level count. When the level
+/// count reaches zero, the upreferenced type is the type that is passed in:
+/// thus we can complete the cycle.
+///
+static PATypeHolder HandleUpRefs(const Type *ty) {
+ if (!ty->isAbstract()) return ty;
+ PATypeHolder Ty(ty);
+ UR_OUT("Type '" << Ty->getDescription() <<
+ "' newly formed. Resolving upreferences.\n" <<
+ UpRefs.size() << " upreferences active!\n");
+
+ // If we find any resolvable upreferences (i.e., those whose NestingLevel goes
+ // to zero), we resolve them all together before we resolve them to Ty. At
+ // the end of the loop, if there is anything to resolve to Ty, it will be in
+ // this variable.
+ OpaqueType *TypeToResolve = 0;
+
+ for (unsigned i = 0; i != UpRefs.size(); ++i) {
+ UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
+ << UpRefs[i].second->getDescription() << ") = "
+ << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
+ if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
+ // Decrement level of upreference
+ unsigned Level = --UpRefs[i].NestingLevel;
+ UpRefs[i].LastContainedTy = Ty;
+ UR_OUT(" Uplevel Ref Level = " << Level << "\n");
+ if (Level == 0) { // Upreference should be resolved!
+ if (!TypeToResolve) {
+ TypeToResolve = UpRefs[i].UpRefTy;
+ } else {
+ UR_OUT(" * Resolving upreference for "
+ << UpRefs[i].second->getDescription() << "\n";
+ std::string OldName = UpRefs[i].UpRefTy->getDescription());
+ UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
+ UR_OUT(" * Type '" << OldName << "' refined upreference to: "
+ << (const void*)Ty << ", " << Ty->getDescription() << "\n");
+ }
+ UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
+ --i; // Do not skip the next element...
+ }
+ }
+ }
+
+ if (TypeToResolve) {
+ UR_OUT(" * Resolving upreference for "
+ << UpRefs[i].second->getDescription() << "\n";
+ std::string OldName = TypeToResolve->getDescription());
+ TypeToResolve->refineAbstractTypeTo(Ty);
+ }
+
+ return Ty;
+}
+
+
+// common code from the two 'RunVMAsmParser' functions
+ static Module * RunParser(Module * M) {
+
+ llvmAsmlineno = 1; // Reset the current line number...
+ ObsoleteVarArgs = false;
+ NewVarArgs = false;
+
+ CurModule.CurrentModule = M;
+ yyparse(); // Parse the file, potentially throwing exception
+
+ Module *Result = ParserResult;
+ ParserResult = 0;
+
+ //Not all functions use vaarg, so make a second check for ObsoleteVarArgs
+ {
+ Function* F;
+ if ((F = Result->getNamedFunction("llvm.va_start"))
+ && F->getFunctionType()->getNumParams() == 0)
+ ObsoleteVarArgs = true;
+ if((F = Result->getNamedFunction("llvm.va_copy"))
+ && F->getFunctionType()->getNumParams() == 1)
+ ObsoleteVarArgs = true;
+ }
+
+ if (ObsoleteVarArgs && NewVarArgs)
+ ThrowException("This file is corrupt: it uses both new and old style varargs");
+
+ if(ObsoleteVarArgs) {
+ if(Function* F = Result->getNamedFunction("llvm.va_start")) {
+ if (F->arg_size() != 0)
+ ThrowException("Obsolete va_start takes 0 argument!");
+
+ //foo = va_start()
+ // ->
+ //bar = alloca typeof(foo)
+ //va_start(bar)
+ //foo = load bar
+
+ const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
+ const Type* ArgTy = F->getFunctionType()->getReturnType();
+ const Type* ArgTyPtr = PointerType::get(ArgTy);
+ Function* NF = Result->getOrInsertFunction("llvm.va_start",
+ RetTy, ArgTyPtr, 0);
+
+ while (!F->use_empty()) {
+ CallInst* CI = cast<CallInst>(F->use_back());
+ AllocaInst* bar = new AllocaInst(ArgTy, 0, "vastart.fix.1", CI);
+ new CallInst(NF, bar, "", CI);
+ Value* foo = new LoadInst(bar, "vastart.fix.2", CI);
+ CI->replaceAllUsesWith(foo);
+ CI->getParent()->getInstList().erase(CI);
+ }
+ Result->getFunctionList().erase(F);
+ }
+
+ if(Function* F = Result->getNamedFunction("llvm.va_end")) {
+ if(F->arg_size() != 1)
+ ThrowException("Obsolete va_end takes 1 argument!");
+
+ //vaend foo
+ // ->
+ //bar = alloca 1 of typeof(foo)
+ //vaend bar
+ const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
+ const Type* ArgTy = F->getFunctionType()->getParamType(0);
+ const Type* ArgTyPtr = PointerType::get(ArgTy);
+ Function* NF = Result->getOrInsertFunction("llvm.va_end",
+ RetTy, ArgTyPtr, 0);
+
+ while (!F->use_empty()) {
+ CallInst* CI = cast<CallInst>(F->use_back());
+ AllocaInst* bar = new AllocaInst(ArgTy, 0, "vaend.fix.1", CI);
+ new StoreInst(CI->getOperand(1), bar, CI);
+ new CallInst(NF, bar, "", CI);
+ CI->getParent()->getInstList().erase(CI);
+ }
+ Result->getFunctionList().erase(F);
+ }
+
+ if(Function* F = Result->getNamedFunction("llvm.va_copy")) {
+ if(F->arg_size() != 1)
+ ThrowException("Obsolete va_copy takes 1 argument!");
+ //foo = vacopy(bar)
+ // ->
+ //a = alloca 1 of typeof(foo)
+ //b = alloca 1 of typeof(foo)
+ //store bar -> b
+ //vacopy(a, b)
+ //foo = load a
+
+ const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
+ const Type* ArgTy = F->getFunctionType()->getReturnType();
+ const Type* ArgTyPtr = PointerType::get(ArgTy);
+ Function* NF = Result->getOrInsertFunction("llvm.va_copy",
+ RetTy, ArgTyPtr, ArgTyPtr, 0);
+
+ while (!F->use_empty()) {
+ CallInst* CI = cast<CallInst>(F->use_back());
+ AllocaInst* a = new AllocaInst(ArgTy, 0, "vacopy.fix.1", CI);
+ AllocaInst* b = new AllocaInst(ArgTy, 0, "vacopy.fix.2", CI);
+ new StoreInst(CI->getOperand(1), b, CI);
+ new CallInst(NF, a, b, "", CI);
+ Value* foo = new LoadInst(a, "vacopy.fix.3", CI);
+ CI->replaceAllUsesWith(foo);
+ CI->getParent()->getInstList().erase(CI);
+ }
+ Result->getFunctionList().erase(F);
+ }
+ }
+
+ return Result;
+
+ }
+
+//===----------------------------------------------------------------------===//
+// RunVMAsmParser - Define an interface to this parser
+//===----------------------------------------------------------------------===//
+//
+Module *llvm::RunVMAsmParser(const std::string &Filename, FILE *F) {
+ set_scan_file(F);
+
+ CurFilename = Filename;
+ return RunParser(new Module(CurFilename));
+}
+
+Module *llvm::RunVMAsmParser(const char * AsmString, Module * M) {
+ set_scan_string(AsmString);
+
+ CurFilename = "from_memory";
+ if (M == NULL) {
+ return RunParser(new Module (CurFilename));
+ } else {
+ return RunParser(M);
+ }
+}
+
+
+
+/* Enabling traces. */
+#ifndef YYDEBUG
+# define YYDEBUG 0
+#endif
+
+/* Enabling verbose error messages. */
+#ifdef YYERROR_VERBOSE
+# undef YYERROR_VERBOSE
+# define YYERROR_VERBOSE 1
+#else
+# define YYERROR_VERBOSE 0
+#endif
+
+#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED)
+#line 865 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+typedef union YYSTYPE {
+ llvm::Module *ModuleVal;
+ llvm::Function *FunctionVal;
+ std::pair<llvm::PATypeHolder*, char*> *ArgVal;
+ llvm::BasicBlock *BasicBlockVal;
+ llvm::TerminatorInst *TermInstVal;
+ llvm::Instruction *InstVal;
+ llvm::Constant *ConstVal;
+
+ const llvm::Type *PrimType;
+ llvm::PATypeHolder *TypeVal;
+ llvm::Value *ValueVal;
+
+ std::vector<std::pair<llvm::PATypeHolder*,char*> > *ArgList;
+ std::vector<llvm::Value*> *ValueList;
+ std::list<llvm::PATypeHolder> *TypeList;
+ // Represent the RHS of PHI node
+ std::list<std::pair<llvm::Value*,
+ llvm::BasicBlock*> > *PHIList;
+ std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
+ std::vector<llvm::Constant*> *ConstVector;
+
+ llvm::GlobalValue::LinkageTypes Linkage;
+ int64_t SInt64Val;
+ uint64_t UInt64Val;
+ int SIntVal;
+ unsigned UIntVal;
+ double FPVal;
+ bool BoolVal;
+
+ char *StrVal; // This memory is strdup'd!
+ llvm::ValID ValIDVal; // strdup'd memory maybe!
+
+ llvm::Instruction::BinaryOps BinaryOpVal;
+ llvm::Instruction::TermOps TermOpVal;
+ llvm::Instruction::MemoryOps MemOpVal;
+ llvm::Instruction::OtherOps OtherOpVal;
+ llvm::Module::Endianness Endianness;
+} YYSTYPE;
+/* Line 191 of yacc.c. */
+#line 1162 "llvmAsmParser.tab.c"
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+# define YYSTYPE_IS_TRIVIAL 1
+#endif
+
+
+
+/* Copy the second part of user declarations. */
+
+
+/* Line 214 of yacc.c. */
+#line 1174 "llvmAsmParser.tab.c"
+
+#if ! defined (yyoverflow) || YYERROR_VERBOSE
+
+# ifndef YYFREE
+# define YYFREE free
+# endif
+# ifndef YYMALLOC
+# define YYMALLOC malloc
+# endif
+
+/* The parser invokes alloca or malloc; define the necessary symbols. */
+
+# ifdef YYSTACK_USE_ALLOCA
+# if YYSTACK_USE_ALLOCA
+# define YYSTACK_ALLOC alloca
+# endif
+# else
+# if defined (alloca) || defined (_ALLOCA_H)
+# define YYSTACK_ALLOC alloca
+# else
+# ifdef __GNUC__
+# define YYSTACK_ALLOC __builtin_alloca
+# endif
+# endif
+# endif
+
+# ifdef YYSTACK_ALLOC
+ /* Pacify GCC's `empty if-body' warning. */
+# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
+# else
+# if defined (__STDC__) || defined (__cplusplus)
+# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+# define YYSIZE_T size_t
+# endif
+# define YYSTACK_ALLOC YYMALLOC
+# define YYSTACK_FREE YYFREE
+# endif
+#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */
+
+
+#if (! defined (yyoverflow) \
+ && (! defined (__cplusplus) \
+ || (defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL)))
+
+/* A type that is properly aligned for any stack member. */
+union yyalloc
+{
+ short yyss;
+ YYSTYPE yyvs;
+ };
+
+/* The size of the maximum gap between one aligned stack and the next. */
+# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
+
+/* The size of an array large to enough to hold all stacks, each with
+ N elements. */
+# define YYSTACK_BYTES(N) \
+ ((N) * (sizeof (short) + sizeof (YYSTYPE)) \
+ + YYSTACK_GAP_MAXIMUM)
+
+/* Copy COUNT objects from FROM to TO. The source and destination do
+ not overlap. */
+# ifndef YYCOPY
+# if defined (__GNUC__) && 1 < __GNUC__
+# define YYCOPY(To, From, Count) \
+ __builtin_memcpy (To, From, (Count) * sizeof (*(From)))
+# else
+# define YYCOPY(To, From, Count) \
+ do \
+ { \
+ register YYSIZE_T yyi; \
+ for (yyi = 0; yyi < (Count); yyi++) \
+ (To)[yyi] = (From)[yyi]; \
+ } \
+ while (0)
+# endif
+# endif
+
+/* Relocate STACK from its old location to the new one. The
+ local variables YYSIZE and YYSTACKSIZE give the old and new number of
+ elements in the stack, and YYPTR gives the new location of the
+ stack. Advance YYPTR to a properly aligned location for the next
+ stack. */
+# define YYSTACK_RELOCATE(Stack) \
+ do \
+ { \
+ YYSIZE_T yynewbytes; \
+ YYCOPY (&yyptr->Stack, Stack, yysize); \
+ Stack = &yyptr->Stack; \
+ yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
+ yyptr += yynewbytes / sizeof (*yyptr); \
+ } \
+ while (0)
+
+#endif
+
+#if defined (__STDC__) || defined (__cplusplus)
+ typedef signed char yysigned_char;
+#else
+ typedef short yysigned_char;
+#endif
+
+/* YYFINAL -- State number of the termination state. */
+#define YYFINAL 4
+/* YYLAST -- Last index in YYTABLE. */
+#define YYLAST 1102
+
+/* YYNTOKENS -- Number of terminals. */
+#define YYNTOKENS 108
+/* YYNNTS -- Number of nonterminals. */
+#define YYNNTS 62
+/* YYNRULES -- Number of rules. */
+#define YYNRULES 212
+/* YYNRULES -- Number of states. */
+#define YYNSTATES 419
+
+/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
+#define YYUNDEFTOK 2
+#define YYMAXUTOK 348
+
+#define YYTRANSLATE(YYX) \
+ ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
+
+/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
+static const unsigned char yytranslate[] =
+{
+ 0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 96, 97, 105, 2, 106, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 101, 94, 102, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 98, 95, 100, 2, 2, 2, 2, 2, 107,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 99, 2, 2, 103, 2, 104, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 1, 2, 3, 4,
+ 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
+ 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
+ 25, 26, 27, 28, 29, 30, 31, 32, 33, 34,
+ 35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
+ 45, 46, 47, 48, 49, 50, 51, 52, 53, 54,
+ 55, 56, 57, 58, 59, 60, 61, 62, 63, 64,
+ 65, 66, 67, 68, 69, 70, 71, 72, 73, 74,
+ 75, 76, 77, 78, 79, 80, 81, 82, 83, 84,
+ 85, 86, 87, 88, 89, 90, 91, 92, 93
+};
+
+#if YYDEBUG
+/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
+ YYRHS. */
+static const unsigned short yyprhs[] =
+{
+ 0, 0, 3, 5, 7, 9, 11, 13, 15, 17,
+ 19, 21, 23, 25, 27, 29, 31, 33, 35, 37,
+ 39, 41, 43, 45, 47, 49, 51, 53, 55, 57,
+ 59, 61, 63, 65, 67, 70, 71, 73, 75, 77,
+ 79, 80, 81, 83, 85, 87, 90, 92, 94, 96,
+ 98, 100, 102, 104, 106, 108, 110, 112, 114, 116,
+ 118, 120, 122, 124, 126, 128, 130, 132, 135, 140,
+ 146, 152, 156, 159, 162, 164, 168, 170, 174, 176,
+ 177, 182, 186, 190, 195, 200, 204, 207, 210, 213,
+ 216, 219, 222, 225, 228, 231, 234, 241, 247, 256,
+ 263, 270, 277, 284, 288, 290, 292, 294, 296, 299,
+ 302, 305, 307, 312, 315, 321, 327, 331, 336, 337,
+ 339, 341, 345, 349, 353, 357, 361, 363, 364, 366,
+ 368, 370, 371, 374, 378, 380, 382, 386, 388, 389,
+ 396, 398, 400, 404, 406, 408, 411, 412, 416, 418,
+ 420, 422, 424, 426, 428, 430, 434, 436, 438, 440,
+ 442, 444, 447, 450, 453, 457, 460, 461, 463, 466,
+ 469, 473, 483, 493, 502, 516, 518, 520, 527, 533,
+ 536, 543, 551, 553, 557, 559, 560, 563, 565, 571,
+ 577, 583, 586, 591, 596, 603, 608, 613, 618, 621,
+ 629, 631, 634, 635, 637, 638, 641, 647, 650, 656,
+ 659, 664, 671
+};
+
+/* YYRHS -- A `-1'-separated list of the rules' RHS. */
+static const short yyrhs[] =
+{
+ 133, 0, -1, 5, -1, 6, -1, 3, -1, 4,
+ -1, 66, -1, 67, -1, 68, -1, 69, -1, 70,
+ -1, 71, -1, 72, -1, 73, -1, 74, -1, 75,
+ -1, 76, -1, 77, -1, 78, -1, 79, -1, 89,
+ -1, 90, -1, 16, -1, 14, -1, 12, -1, 10,
+ -1, 17, -1, 15, -1, 13, -1, 11, -1, 115,
+ -1, 116, -1, 18, -1, 19, -1, 140, 94, -1,
+ -1, 40, -1, 41, -1, 42, -1, 43, -1, -1,
+ -1, 57, -1, 58, -1, 59, -1, 56, 4, -1,
+ 124, -1, 8, -1, 126, -1, 8, -1, 126, -1,
+ 9, -1, 10, -1, 11, -1, 12, -1, 13, -1,
+ 14, -1, 15, -1, 16, -1, 17, -1, 18, -1,
+ 19, -1, 20, -1, 21, -1, 44, -1, 125, -1,
+ 153, -1, 95, 4, -1, 123, 96, 128, 97, -1,
+ 98, 4, 99, 126, 100, -1, 101, 4, 99, 126,
+ 102, -1, 103, 127, 104, -1, 103, 104, -1, 126,
+ 105, -1, 126, -1, 127, 106, 126, -1, 127, -1,
+ 127, 106, 36, -1, 36, -1, -1, 124, 98, 131,
+ 100, -1, 124, 98, 100, -1, 124, 107, 24, -1,
+ 124, 101, 131, 102, -1, 124, 103, 131, 104, -1,
+ 124, 103, 104, -1, 124, 37, -1, 124, 38, -1,
+ 124, 153, -1, 124, 130, -1, 124, 26, -1, 115,
+ 110, -1, 116, 4, -1, 9, 27, -1, 9, 28,
+ -1, 118, 7, -1, 87, 96, 129, 35, 124, 97,
+ -1, 85, 96, 129, 167, 97, -1, 88, 96, 129,
+ 106, 129, 106, 129, 97, -1, 111, 96, 129, 106,
+ 129, 97, -1, 112, 96, 129, 106, 129, 97, -1,
+ 113, 96, 129, 106, 129, 97, -1, 114, 96, 129,
+ 106, 129, 97, -1, 131, 106, 129, -1, 129, -1,
+ 32, -1, 33, -1, 134, -1, 134, 149, -1, 134,
+ 150, -1, 134, 25, -1, 135, -1, 135, 119, 20,
+ 122, -1, 135, 150, -1, 135, 119, 120, 132, 129,
+ -1, 135, 119, 46, 132, 124, -1, 135, 47, 137,
+ -1, 135, 53, 94, 138, -1, -1, 52, -1, 51,
+ -1, 49, 94, 136, -1, 50, 94, 4, -1, 48,
+ 94, 24, -1, 98, 139, 100, -1, 139, 106, 24,
+ -1, 24, -1, -1, 22, -1, 24, -1, 140, -1,
+ -1, 124, 141, -1, 143, 106, 142, -1, 142, -1,
+ 143, -1, 143, 106, 36, -1, 36, -1, -1, 121,
+ 122, 140, 96, 144, 97, -1, 29, -1, 103, -1,
+ 120, 145, 146, -1, 30, -1, 104, -1, 156, 148,
+ -1, -1, 31, 151, 145, -1, 3, -1, 4, -1,
+ 7, -1, 27, -1, 28, -1, 37, -1, 38, -1,
+ 101, 131, 102, -1, 130, -1, 109, -1, 140, -1,
+ 153, -1, 152, -1, 124, 154, -1, 156, 157, -1,
+ 147, 157, -1, 158, 119, 159, -1, 158, 161, -1,
+ -1, 23, -1, 60, 155, -1, 60, 8, -1, 61,
+ 21, 154, -1, 61, 9, 154, 106, 21, 154, 106,
+ 21, 154, -1, 62, 117, 154, 106, 21, 154, 98,
+ 160, 100, -1, 62, 117, 154, 106, 21, 154, 98,
+ 100, -1, 63, 121, 122, 154, 96, 164, 97, 35,
+ 21, 154, 64, 21, 154, -1, 64, -1, 65, -1,
+ 160, 117, 152, 106, 21, 154, -1, 117, 152, 106,
+ 21, 154, -1, 119, 166, -1, 124, 98, 154, 106,
+ 154, 100, -1, 162, 106, 98, 154, 106, 154, 100,
+ -1, 155, -1, 163, 106, 155, -1, 163, -1, -1,
+ 55, 54, -1, 54, -1, 111, 124, 154, 106, 154,
+ -1, 112, 124, 154, 106, 154, -1, 113, 124, 154,
+ 106, 154, -1, 45, 155, -1, 114, 155, 106, 155,
+ -1, 87, 155, 35, 124, -1, 88, 155, 106, 155,
+ 106, 155, -1, 91, 155, 106, 124, -1, 92, 155,
+ 106, 124, -1, 93, 155, 106, 124, -1, 86, 162,
+ -1, 165, 121, 122, 154, 96, 164, 97, -1, 169,
+ -1, 106, 163, -1, -1, 34, -1, -1, 80, 124,
+ -1, 80, 124, 106, 15, 154, -1, 81, 124, -1,
+ 81, 124, 106, 15, 154, -1, 82, 155, -1, 168,
+ 83, 124, 154, -1, 168, 84, 155, 106, 124, 154,
+ -1, 85, 124, 154, 167, -1
+};
+
+/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
+static const unsigned short yyrline[] =
+{
+ 0, 982, 982, 983, 990, 991, 1000, 1000, 1000, 1000,
+ 1000, 1001, 1001, 1001, 1002, 1002, 1002, 1002, 1002, 1002,
+ 1004, 1004, 1008, 1008, 1008, 1008, 1009, 1009, 1009, 1009,
+ 1010, 1010, 1011, 1011, 1014, 1017, 1021, 1022, 1023, 1024,
+ 1025, 1027, 1028, 1029, 1030, 1031, 1044, 1044, 1045, 1045,
+ 1047, 1056, 1056, 1056, 1056, 1056, 1056, 1056, 1057, 1057,
+ 1057, 1057, 1057, 1057, 1058, 1061, 1064, 1070, 1077, 1089,
+ 1093, 1104, 1113, 1116, 1124, 1128, 1133, 1134, 1137, 1140,
+ 1150, 1175, 1188, 1216, 1241, 1261, 1273, 1282, 1286, 1345,
+ 1351, 1359, 1364, 1369, 1372, 1375, 1382, 1392, 1423, 1430,
+ 1451, 1458, 1463, 1473, 1476, 1483, 1483, 1493, 1500, 1504,
+ 1507, 1510, 1523, 1543, 1545, 1549, 1553, 1555, 1557, 1562,
+ 1563, 1565, 1568, 1576, 1581, 1583, 1587, 1591, 1599, 1599,
+ 1600, 1600, 1602, 1608, 1613, 1619, 1622, 1627, 1631, 1635,
+ 1715, 1715, 1717, 1725, 1725, 1727, 1731, 1731, 1740, 1743,
+ 1746, 1749, 1752, 1755, 1758, 1761, 1785, 1792, 1795, 1800,
+ 1800, 1806, 1810, 1813, 1821, 1830, 1834, 1844, 1855, 1858,
+ 1861, 1864, 1867, 1881, 1885, 1938, 1941, 1947, 1955, 1965,
+ 1972, 1977, 1984, 1988, 1994, 1994, 1996, 1999, 2005, 2017,
+ 2025, 2035, 2047, 2054, 2061, 2068, 2073, 2092, 2114, 2128,
+ 2185, 2191, 2193, 2197, 2200, 2206, 2210, 2214, 2218, 2222,
+ 2229, 2239, 2252
+};
+#endif
+
+#if YYDEBUG || YYERROR_VERBOSE
+/* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
+ First, the terminals, then, starting at YYNTOKENS, nonterminals. */
+static const char *const yytname[] =
+{
+ "$end", "error", "$undefined", "ESINT64VAL", "EUINT64VAL", "SINTVAL",
+ "UINTVAL", "FPVAL", "VOID", "BOOL", "SBYTE", "UBYTE", "SHORT", "USHORT",
+ "INT", "UINT", "LONG", "ULONG", "FLOAT", "DOUBLE", "TYPE", "LABEL",
+ "VAR_ID", "LABELSTR", "STRINGCONSTANT", "IMPLEMENTATION",
+ "ZEROINITIALIZER", "TRUETOK", "FALSETOK", "BEGINTOK", "ENDTOK",
+ "DECLARE", "GLOBAL", "CONSTANT", "VOLATILE", "TO", "DOTDOTDOT",
+ "NULL_TOK", "UNDEF", "CONST", "INTERNAL", "LINKONCE", "WEAK",
+ "APPENDING", "OPAQUE", "NOT", "EXTERNAL", "TARGET", "TRIPLE", "ENDIAN",
+ "POINTERSIZE", "LITTLE", "BIG", "DEPLIBS", "CALL", "TAIL", "CC_TOK",
+ "CCC_TOK", "FASTCC_TOK", "COLDCC_TOK", "RET", "BR", "SWITCH", "INVOKE",
+ "UNWIND", "UNREACHABLE", "ADD", "SUB", "MUL", "DIV", "REM", "AND", "OR",
+ "XOR", "SETLE", "SETGE", "SETLT", "SETGT", "SETEQ", "SETNE", "MALLOC",
+ "ALLOCA", "FREE", "LOAD", "STORE", "GETELEMENTPTR", "PHI_TOK", "CAST",
+ "SELECT", "SHL", "SHR", "VAARG", "VAARG_old", "VANEXT_old", "'='",
+ "'\\\\'", "'('", "')'", "'['", "'x'", "']'", "'<'", "'>'", "'{'", "'}'",
+ "'*'", "','", "'c'", "$accept", "INTVAL", "EINT64VAL", "ArithmeticOps",
+ "LogicalOps", "SetCondOps", "ShiftOps", "SIntType", "UIntType",
+ "IntType", "FPType", "OptAssign", "OptLinkage", "OptCallingConv",
+ "TypesV", "UpRTypesV", "Types", "PrimType", "UpRTypes", "TypeListI",
+ "ArgTypeListI", "ConstVal", "ConstExpr", "ConstVector", "GlobalType",
+ "Module", "FunctionList", "ConstPool", "BigOrLittle", "TargetDefinition",
+ "LibrariesDefinition", "LibList", "Name", "OptName", "ArgVal",
+ "ArgListH", "ArgList", "FunctionHeaderH", "BEGIN", "FunctionHeader",
+ "END", "Function", "FunctionProto", "@1", "ConstValueRef",
+ "SymbolicValueRef", "ValueRef", "ResolvedVal", "BasicBlockList",
+ "BasicBlock", "InstructionList", "BBTerminatorInst", "JumpTable", "Inst",
+ "PHIList", "ValueRefList", "ValueRefListE", "OptTailCall", "InstVal",
+ "IndexList", "OptVolatile", "MemoryInst", 0
+};
+#endif
+
+# ifdef YYPRINT
+/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
+ token YYLEX-NUM. */
+static const unsigned short yytoknum[] =
+{
+ 0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
+ 265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
+ 275, 276, 277, 278, 279, 280, 281, 282, 283, 284,
+ 285, 286, 287, 288, 289, 290, 291, 292, 293, 294,
+ 295, 296, 297, 298, 299, 300, 301, 302, 303, 304,
+ 305, 306, 307, 308, 309, 310, 311, 312, 313, 314,
+ 315, 316, 317, 318, 319, 320, 321, 322, 323, 324,
+ 325, 326, 327, 328, 329, 330, 331, 332, 333, 334,
+ 335, 336, 337, 338, 339, 340, 341, 342, 343, 344,
+ 345, 346, 347, 348, 61, 92, 40, 41, 91, 120,
+ 93, 60, 62, 123, 125, 42, 44, 99
+};
+# endif
+
+/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
+static const unsigned char yyr1[] =
+{
+ 0, 108, 109, 109, 110, 110, 111, 111, 111, 111,
+ 111, 112, 112, 112, 113, 113, 113, 113, 113, 113,
+ 114, 114, 115, 115, 115, 115, 116, 116, 116, 116,
+ 117, 117, 118, 118, 119, 119, 120, 120, 120, 120,
+ 120, 121, 121, 121, 121, 121, 122, 122, 123, 123,
+ 124, 125, 125, 125, 125, 125, 125, 125, 125, 125,
+ 125, 125, 125, 125, 126, 126, 126, 126, 126, 126,
+ 126, 126, 126, 126, 127, 127, 128, 128, 128, 128,
+ 129, 129, 129, 129, 129, 129, 129, 129, 129, 129,
+ 129, 129, 129, 129, 129, 129, 130, 130, 130, 130,
+ 130, 130, 130, 131, 131, 132, 132, 133, 134, 134,
+ 134, 134, 135, 135, 135, 135, 135, 135, 135, 136,
+ 136, 137, 137, 137, 138, 139, 139, 139, 140, 140,
+ 141, 141, 142, 143, 143, 144, 144, 144, 144, 145,
+ 146, 146, 147, 148, 148, 149, 151, 150, 152, 152,
+ 152, 152, 152, 152, 152, 152, 152, 153, 153, 154,
+ 154, 155, 156, 156, 157, 158, 158, 158, 159, 159,
+ 159, 159, 159, 159, 159, 159, 159, 160, 160, 161,
+ 162, 162, 163, 163, 164, 164, 165, 165, 166, 166,
+ 166, 166, 166, 166, 166, 166, 166, 166, 166, 166,
+ 166, 167, 167, 168, 168, 169, 169, 169, 169, 169,
+ 169, 169, 169
+};
+
+/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
+static const unsigned char yyr2[] =
+{
+ 0, 2, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 2, 0, 1, 1, 1, 1,
+ 0, 0, 1, 1, 1, 2, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 2, 4, 5,
+ 5, 3, 2, 2, 1, 3, 1, 3, 1, 0,
+ 4, 3, 3, 4, 4, 3, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 6, 5, 8, 6,
+ 6, 6, 6, 3, 1, 1, 1, 1, 2, 2,
+ 2, 1, 4, 2, 5, 5, 3, 4, 0, 1,
+ 1, 3, 3, 3, 3, 3, 1, 0, 1, 1,
+ 1, 0, 2, 3, 1, 1, 3, 1, 0, 6,
+ 1, 1, 3, 1, 1, 2, 0, 3, 1, 1,
+ 1, 1, 1, 1, 1, 3, 1, 1, 1, 1,
+ 1, 2, 2, 2, 3, 2, 0, 1, 2, 2,
+ 3, 9, 9, 8, 13, 1, 1, 6, 5, 2,
+ 6, 7, 1, 3, 1, 0, 2, 1, 5, 5,
+ 5, 2, 4, 4, 6, 4, 4, 4, 2, 7,
+ 1, 2, 0, 1, 0, 2, 5, 2, 5, 2,
+ 4, 6, 4
+};
+
+/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
+ STATE-NUM when YYTABLE doesn't specify something else to do. Zero
+ means the default is an error. */
+static const unsigned char yydefact[] =
+{
+ 118, 0, 40, 111, 1, 110, 146, 36, 37, 38,
+ 39, 41, 166, 108, 109, 166, 128, 129, 0, 0,
+ 40, 0, 113, 41, 0, 42, 43, 44, 0, 0,
+ 167, 163, 35, 143, 144, 145, 162, 0, 0, 0,
+ 116, 0, 0, 0, 0, 34, 147, 45, 2, 3,
+ 47, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+ 60, 61, 62, 63, 64, 0, 0, 0, 0, 157,
+ 0, 0, 46, 65, 50, 158, 66, 140, 141, 142,
+ 204, 165, 0, 0, 0, 127, 117, 112, 105, 106,
+ 0, 0, 67, 0, 0, 49, 72, 74, 0, 0,
+ 79, 73, 203, 0, 187, 0, 0, 0, 0, 41,
+ 175, 176, 6, 7, 8, 9, 10, 11, 12, 13,
+ 14, 15, 16, 17, 18, 19, 0, 0, 0, 0,
+ 0, 0, 0, 20, 21, 0, 0, 0, 0, 0,
+ 0, 0, 164, 41, 179, 0, 200, 123, 120, 119,
+ 121, 122, 126, 0, 115, 51, 52, 53, 54, 55,
+ 56, 57, 58, 59, 60, 61, 0, 0, 0, 0,
+ 114, 0, 0, 71, 0, 138, 78, 76, 0, 0,
+ 191, 186, 169, 168, 0, 0, 25, 29, 24, 28,
+ 23, 27, 22, 26, 30, 31, 0, 0, 205, 207,
+ 209, 0, 0, 198, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 124, 0, 93, 94,
+ 4, 5, 91, 92, 95, 90, 86, 87, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 89,
+ 88, 48, 48, 75, 137, 131, 134, 135, 0, 0,
+ 68, 148, 149, 150, 151, 152, 153, 154, 0, 156,
+ 160, 159, 161, 0, 170, 0, 0, 0, 0, 202,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 125, 0, 0, 0, 81, 104,
+ 0, 0, 85, 0, 82, 0, 0, 0, 0, 69,
+ 70, 130, 132, 0, 139, 77, 0, 0, 0, 0,
+ 0, 0, 0, 212, 0, 0, 193, 0, 195, 196,
+ 197, 0, 0, 0, 192, 0, 210, 0, 202, 0,
+ 0, 80, 0, 83, 84, 0, 0, 0, 0, 136,
+ 133, 155, 0, 0, 185, 206, 208, 182, 201, 0,
+ 0, 0, 188, 189, 190, 185, 0, 0, 0, 0,
+ 103, 0, 0, 0, 0, 0, 0, 184, 0, 0,
+ 0, 0, 194, 0, 211, 97, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 183, 180, 0, 199, 96,
+ 0, 99, 100, 101, 102, 0, 173, 0, 0, 0,
+ 181, 0, 171, 0, 172, 0, 0, 98, 0, 0,
+ 0, 0, 0, 0, 178, 0, 0, 177, 174
+};
+
+/* YYDEFGOTO[NTERM-NUM]. */
+static const short yydefgoto[] =
+{
+ -1, 69, 222, 235, 236, 237, 238, 166, 167, 196,
+ 168, 20, 11, 28, 70, 71, 169, 73, 74, 98,
+ 178, 289, 259, 290, 90, 1, 2, 3, 150, 40,
+ 86, 153, 75, 302, 246, 247, 248, 29, 79, 12,
+ 35, 13, 14, 23, 260, 76, 262, 347, 15, 31,
+ 32, 142, 398, 81, 203, 367, 368, 143, 144, 313,
+ 145, 146
+};
+
+/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
+ STATE-NUM. */
+#define YYPACT_NINF -383
+static const short yypact[] =
+{
+ -383, 48, 136, 517, -383, -383, -383, -383, -383, -383,
+ -383, 27, 36, -383, -383, -17, -383, -383, 46, -21,
+ -3, 3, -383, 27, 73, -383, -383, -383, 879, -24,
+ -383, -383, 113, -383, -383, -383, -383, 20, 51, 60,
+ -383, 21, 879, -13, -13, -383, -383, -383, -383, -383,
+ 62, -383, -383, -383, -383, -383, -383, -383, -383, -383,
+ -383, -383, -383, -383, -383, 156, 162, 164, 480, -383,
+ 113, 76, -383, -383, -25, -383, -383, -383, -383, -383,
+ 992, -383, 149, 37, 170, 157, -383, -383, -383, -383,
+ 900, 941, -383, 81, 83, -383, -383, -25, 34, 87,
+ 643, -383, -383, 900, -383, 130, 999, 32, 243, 27,
+ -383, -383, -383, -383, -383, -383, -383, -383, -383, -383,
+ -383, -383, -383, -383, -383, -383, 900, 900, 900, 900,
+ 900, 900, 900, -383, -383, 900, 900, 900, 900, 900,
+ 900, 900, -383, 27, -383, 22, -383, -383, -383, -383,
+ -383, -383, -383, -82, -383, 122, 148, 184, 153, 185,
+ 159, 186, 161, 187, 191, 193, 167, 197, 195, 380,
+ -383, 900, 900, -383, 900, 680, -383, 97, 114, 549,
+ -383, -383, 62, -383, 549, 549, -383, -383, -383, -383,
+ -383, -383, -383, -383, -383, -383, 549, 879, 108, 109,
+ -383, 549, 118, 111, 183, 116, 117, 119, 121, 549,
+ 549, 549, 124, 879, 900, 900, -383, 196, -383, -383,
+ -383, -383, -383, -383, -383, -383, -383, -383, 123, 132,
+ 135, 742, 941, 501, 208, 137, 144, 145, 147, -383,
+ -383, -84, -12, -25, -383, 113, -383, 155, 154, 779,
+ -383, -383, -383, -383, -383, -383, -383, -383, 941, -383,
+ -383, -383, -383, 158, -383, 160, 549, 235, 247, 173,
+ 549, 165, 900, 900, 900, 900, 900, 174, 175, 176,
+ 900, 549, 549, 177, -383, 941, 941, 941, -383, -383,
+ -54, -57, -383, 42, -383, 941, 941, 941, 941, -383,
+ -383, -383, -383, 842, -383, -383, -30, 244, 246, 172,
+ 549, 549, 900, -383, 179, 549, -383, 180, -383, -383,
+ -383, 549, 549, 549, -383, 194, -383, 900, 173, 241,
+ 181, -383, 941, -383, -383, 190, 198, 199, 202, -383,
+ -383, -383, 549, 549, 900, -383, -383, -383, 205, 549,
+ 206, 900, -383, -383, -383, 900, 549, 192, 900, 941,
+ -383, 941, 941, 941, 941, 207, 203, 205, 200, 900,
+ 214, 549, -383, 218, -383, -383, 220, 212, 222, 223,
+ 224, 225, 281, 17, 268, -383, -383, 226, -383, -383,
+ 941, -383, -383, -383, -383, 549, -383, 54, 53, 303,
+ -383, 228, -383, 227, -383, 54, 549, -383, 307, 231,
+ 265, 549, 310, 311, -383, 549, 549, -383, -383
+};
+
+/* YYPGOTO[NTERM-NUM]. */
+static const short yypgoto[] =
+{
+ -383, -383, -383, 254, 262, 264, 272, -106, -105, -372,
+ -383, 313, 333, -101, -38, -383, -28, -383, -56, 255,
+ -383, -90, 188, -223, 312, -383, -383, -383, -383, -383,
+ -383, -383, 4, -383, 55, -383, -383, 331, -383, -383,
+ -383, -383, 356, -383, -382, 25, 28, -81, -383, 345,
+ -383, -383, -383, -383, -383, 49, 7, -383, -383, 35,
+ -383, -383
+};
+
+/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
+ positive, shift that token. If negative, reduce the rule which
+ number is the opposite. If zero, do what YYDEFACT says.
+ If YYTABLE_NINF, syntax error. */
+#define YYTABLE_NINF -108
+static const short yytable[] =
+{
+ 72, 170, 194, 195, 87, 77, 30, 21, 197, 291,
+ 293, 397, 97, 33, 72, 403, 299, 42, 216, 88,
+ 89, 101, 180, 409, 217, 183, 405, 186, 187, 188,
+ 189, 190, 191, 192, 193, 306, 21, 7, 8, 9,
+ 10, 184, 213, 43, 97, 333, 331, 200, 4, 332,
+ 204, 205, 332, 185, 206, 207, 208, 251, 252, 30,
+ 212, 253, 154, 186, 187, 188, 189, 190, 191, 192,
+ 193, -48, 341, 41, 99, 179, 332, 47, 179, 78,
+ 101, 254, 255, 24, 25, 26, 27, 34, 148, 149,
+ 300, 256, 257, 101, 37, 38, 39, 45, 198, 199,
+ 179, 201, 202, 179, 179, 214, 215, 179, 179, 179,
+ 209, 210, 211, 179, 82, 241, 242, 396, 243, 85,
+ 112, 113, 114, 115, 116, 117, 118, 119, 120, 121,
+ 122, 123, 124, 125, 283, 16, -107, 17, 173, 228,
+ 174, 229, 230, 133, 134, 83, 334, 245, 332, 218,
+ 219, -25, -25, 404, 84, 258, -24, -24, -49, 266,
+ 92, 5, -23, -23, -22, -22, 93, 6, 94, 72,
+ 220, 221, 100, 147, 151, 281, 7, 8, 9, 10,
+ 171, 152, 172, 175, 181, 72, 282, 179, -29, -28,
+ -27, -26, 317, 243, 240, 328, 329, 330, -32, 324,
+ -33, 223, 224, 249, 261, 335, 336, 337, 338, 261,
+ 261, 250, 263, 264, 267, 268, 270, 271, 272, 285,
+ 284, 261, 273, 274, 265, 275, 261, 276, 286, 269,
+ 280, 287, 294, 295, 261, 261, 261, 277, 278, 279,
+ 296, 297, 360, 298, 316, 179, 318, 319, 320, 301,
+ 310, 304, 179, 186, 187, 188, 189, 190, 191, 192,
+ 193, 303, 311, 315, 307, 342, 308, 343, 344, 377,
+ 372, 378, 379, 380, 381, 245, 358, 194, 195, 312,
+ 321, 322, 323, 327, 179, 349, 351, 359, 385, 375,
+ 355, 261, 194, 195, 309, 261, 361, 384, 314, 356,
+ 401, 383, 395, 399, 362, 363, 261, 261, 364, 325,
+ 326, 369, 371, 382, 386, 388, 179, 389, 390, 391,
+ 392, 393, 394, 179, 406, 407, 400, 179, 411, 413,
+ 376, 415, 416, 408, 138, 261, 261, 412, 345, 346,
+ 261, 179, 139, 350, 140, 80, 261, 261, 261, 352,
+ 353, 354, 141, 44, 46, 177, 91, 239, 340, 22,
+ 36, 348, 373, 357, 0, 0, 0, 261, 261, 0,
+ 365, 366, 0, 0, 261, 0, 0, 370, 0, 0,
+ 0, 261, 0, 0, 374, 48, 49, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 261, 0, 0, 387,
+ 0, 0, 16, 0, 17, 0, 225, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 226, 227, 0,
+ 261, 0, 0, 402, 0, 0, 0, 0, 0, 0,
+ 0, 261, 0, 0, 410, 0, 261, 0, 0, 414,
+ 261, 261, 0, 417, 418, 0, 112, 113, 114, 115,
+ 116, 117, 118, 119, 120, 121, 122, 123, 124, 125,
+ 0, 0, 0, 0, 0, 228, 0, 229, 230, 133,
+ 134, 0, 0, 0, 0, 0, 0, 0, 231, 0,
+ 0, 232, 0, 233, 0, 48, 49, 234, 95, 51,
+ 52, 53, 54, 55, 56, 57, 58, 59, 60, 61,
+ 62, 63, 16, 0, 17, 0, 48, 49, 0, 95,
+ 155, 156, 157, 158, 159, 160, 161, 162, 163, 164,
+ 165, 62, 63, 16, 64, 17, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, -35, 0, 16,
+ 0, 17, 0, 0, 0, 64, 0, 0, 6, -35,
+ -35, 0, 251, 252, 48, 49, 253, -35, -35, -35,
+ -35, 0, 0, -35, 18, 0, 0, 0, 0, 0,
+ 19, 16, 0, 17, 0, 65, 254, 255, 66, 0,
+ 0, 67, 0, 68, 96, 0, 256, 257, 0, 0,
+ 0, 0, 0, 0, 0, 0, 65, 0, 0, 66,
+ 0, 0, 67, 0, 68, 292, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 112, 113, 114, 115, 116,
+ 117, 118, 119, 120, 121, 122, 123, 124, 125, 0,
+ 0, 0, 0, 0, 228, 0, 229, 230, 133, 134,
+ 0, 0, 0, 0, 0, 0, 0, 0, 48, 49,
+ 258, 95, 51, 52, 53, 54, 55, 56, 57, 58,
+ 59, 60, 61, 62, 63, 16, 0, 17, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 176,
+ 0, 0, 0, 0, 0, 48, 49, 64, 95, 51,
+ 52, 53, 54, 55, 56, 57, 58, 59, 60, 61,
+ 62, 63, 16, 0, 17, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 244, 0, 0, 0,
+ 0, 0, 0, 0, 64, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 65, 0,
+ 0, 66, 0, 0, 67, 0, 68, 48, 49, 0,
+ 95, 155, 156, 157, 158, 159, 160, 161, 162, 163,
+ 164, 165, 62, 63, 16, 0, 17, 0, 0, 0,
+ 0, 0, 0, 0, 0, 65, 0, 0, 66, 0,
+ 0, 67, 0, 68, 48, 49, 64, 95, 51, 52,
+ 53, 54, 55, 56, 57, 58, 59, 60, 61, 62,
+ 63, 16, 0, 17, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 305, 0, 0, 0, 0,
+ 0, 0, 0, 64, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 65, 0, 0,
+ 66, 0, 288, 67, 0, 68, 0, 48, 49, 0,
+ 95, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+ 60, 61, 62, 63, 16, 0, 17, 0, 0, 0,
+ 0, 0, 0, 0, 65, 0, 0, 66, 339, 0,
+ 67, 0, 68, 0, 48, 49, 64, 50, 51, 52,
+ 53, 54, 55, 56, 57, 58, 59, 60, 61, 62,
+ 63, 16, 0, 17, 0, 48, 49, 0, 95, 51,
+ 52, 53, 54, 55, 56, 57, 58, 59, 60, 61,
+ 62, 63, 16, 64, 17, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 65, 0, 0,
+ 66, 0, 0, 67, 64, 68, 48, 49, 0, 95,
+ 155, 156, 157, 158, 159, 160, 161, 162, 163, 164,
+ 165, 62, 63, 16, 0, 17, 0, 0, 0, 0,
+ 0, 0, 0, 0, 65, 0, 0, 66, 0, 0,
+ 67, 0, 68, 0, 0, 64, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 65, 0, 0, 66, 0,
+ 0, 67, 0, 68, 48, 49, 0, 182, 51, 52,
+ 53, 54, 55, 56, 57, 58, 59, 60, 61, 62,
+ 63, 16, 0, 17, 0, 0, 102, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 65, 103, 0, 66,
+ 0, 0, 67, 64, 68, 0, 104, 105, 0, 0,
+ 0, 0, 106, 107, 108, 109, 110, 111, 112, 113,
+ 114, 115, 116, 117, 118, 119, 120, 121, 122, 123,
+ 124, 125, 126, 127, 128, 0, 0, 129, 130, 131,
+ 132, 133, 134, 135, 136, 137, 0, 0, 0, 0,
+ 0, 0, 0, 0, 65, 0, 0, 66, 0, 0,
+ 67, 0, 68
+};
+
+static const short yycheck[] =
+{
+ 28, 91, 108, 108, 42, 29, 23, 3, 109, 232,
+ 233, 383, 68, 30, 42, 397, 100, 20, 100, 32,
+ 33, 105, 103, 405, 106, 106, 398, 10, 11, 12,
+ 13, 14, 15, 16, 17, 258, 32, 40, 41, 42,
+ 43, 9, 143, 46, 100, 102, 100, 128, 0, 106,
+ 131, 132, 106, 21, 135, 136, 137, 3, 4, 23,
+ 141, 7, 90, 10, 11, 12, 13, 14, 15, 16,
+ 17, 96, 102, 94, 70, 103, 106, 4, 106, 103,
+ 105, 27, 28, 56, 57, 58, 59, 104, 51, 52,
+ 102, 37, 38, 105, 48, 49, 50, 94, 126, 127,
+ 128, 129, 130, 131, 132, 83, 84, 135, 136, 137,
+ 138, 139, 140, 141, 94, 171, 172, 100, 174, 98,
+ 66, 67, 68, 69, 70, 71, 72, 73, 74, 75,
+ 76, 77, 78, 79, 215, 22, 0, 24, 104, 85,
+ 106, 87, 88, 89, 90, 94, 104, 175, 106, 27,
+ 28, 3, 4, 100, 94, 101, 3, 4, 96, 197,
+ 4, 25, 3, 4, 3, 4, 4, 31, 4, 197,
+ 3, 4, 96, 24, 4, 213, 40, 41, 42, 43,
+ 99, 24, 99, 96, 54, 213, 214, 215, 4, 4,
+ 4, 4, 273, 249, 169, 285, 286, 287, 7, 280,
+ 7, 4, 7, 106, 179, 295, 296, 297, 298, 184,
+ 185, 97, 184, 185, 106, 106, 98, 106, 35, 96,
+ 24, 196, 106, 106, 196, 106, 201, 106, 96, 201,
+ 106, 96, 24, 96, 209, 210, 211, 209, 210, 211,
+ 96, 96, 332, 96, 272, 273, 274, 275, 276, 245,
+ 15, 97, 280, 10, 11, 12, 13, 14, 15, 16,
+ 17, 106, 15, 98, 106, 21, 106, 21, 96, 359,
+ 351, 361, 362, 363, 364, 303, 35, 383, 383, 106,
+ 106, 106, 106, 106, 312, 106, 106, 106, 369, 97,
+ 96, 266, 398, 398, 266, 270, 106, 97, 270, 327,
+ 390, 98, 21, 35, 106, 106, 281, 282, 106, 281,
+ 282, 106, 106, 106, 100, 97, 344, 97, 106, 97,
+ 97, 97, 97, 351, 21, 97, 100, 355, 21, 64,
+ 358, 21, 21, 106, 80, 310, 311, 106, 310, 311,
+ 315, 369, 80, 315, 80, 32, 321, 322, 323, 321,
+ 322, 323, 80, 20, 23, 100, 44, 169, 303, 3,
+ 15, 312, 355, 328, -1, -1, -1, 342, 343, -1,
+ 342, 343, -1, -1, 349, -1, -1, 349, -1, -1,
+ -1, 356, -1, -1, 356, 5, 6, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, 371, -1, -1, 371,
+ -1, -1, 22, -1, 24, -1, 26, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, 37, 38, -1,
+ 395, -1, -1, 395, -1, -1, -1, -1, -1, -1,
+ -1, 406, -1, -1, 406, -1, 411, -1, -1, 411,
+ 415, 416, -1, 415, 416, -1, 66, 67, 68, 69,
+ 70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
+ -1, -1, -1, -1, -1, 85, -1, 87, 88, 89,
+ 90, -1, -1, -1, -1, -1, -1, -1, 98, -1,
+ -1, 101, -1, 103, -1, 5, 6, 107, 8, 9,
+ 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+ 20, 21, 22, -1, 24, -1, 5, 6, -1, 8,
+ 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,
+ 19, 20, 21, 22, 44, 24, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, 20, -1, 22,
+ -1, 24, -1, -1, -1, 44, -1, -1, 31, 32,
+ 33, -1, 3, 4, 5, 6, 7, 40, 41, 42,
+ 43, -1, -1, 46, 47, -1, -1, -1, -1, -1,
+ 53, 22, -1, 24, -1, 95, 27, 28, 98, -1,
+ -1, 101, -1, 103, 104, -1, 37, 38, -1, -1,
+ -1, -1, -1, -1, -1, -1, 95, -1, -1, 98,
+ -1, -1, 101, -1, 103, 104, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, 66, 67, 68, 69, 70,
+ 71, 72, 73, 74, 75, 76, 77, 78, 79, -1,
+ -1, -1, -1, -1, 85, -1, 87, 88, 89, 90,
+ -1, -1, -1, -1, -1, -1, -1, -1, 5, 6,
+ 101, 8, 9, 10, 11, 12, 13, 14, 15, 16,
+ 17, 18, 19, 20, 21, 22, -1, 24, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, 36,
+ -1, -1, -1, -1, -1, 5, 6, 44, 8, 9,
+ 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+ 20, 21, 22, -1, 24, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, 36, -1, -1, -1,
+ -1, -1, -1, -1, 44, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, 95, -1,
+ -1, 98, -1, -1, 101, -1, 103, 5, 6, -1,
+ 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
+ 18, 19, 20, 21, 22, -1, 24, -1, -1, -1,
+ -1, -1, -1, -1, -1, 95, -1, -1, 98, -1,
+ -1, 101, -1, 103, 5, 6, 44, 8, 9, 10,
+ 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
+ 21, 22, -1, 24, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, 36, -1, -1, -1, -1,
+ -1, -1, -1, 44, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, 95, -1, -1,
+ 98, -1, 100, 101, -1, 103, -1, 5, 6, -1,
+ 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
+ 18, 19, 20, 21, 22, -1, 24, -1, -1, -1,
+ -1, -1, -1, -1, 95, -1, -1, 98, 36, -1,
+ 101, -1, 103, -1, 5, 6, 44, 8, 9, 10,
+ 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
+ 21, 22, -1, 24, -1, 5, 6, -1, 8, 9,
+ 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+ 20, 21, 22, 44, 24, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, 95, -1, -1,
+ 98, -1, -1, 101, 44, 103, 5, 6, -1, 8,
+ 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,
+ 19, 20, 21, 22, -1, 24, -1, -1, -1, -1,
+ -1, -1, -1, -1, 95, -1, -1, 98, -1, -1,
+ 101, -1, 103, -1, -1, 44, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, 95, -1, -1, 98, -1,
+ -1, 101, -1, 103, 5, 6, -1, 8, 9, 10,
+ 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
+ 21, 22, -1, 24, -1, -1, 34, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, 95, 45, -1, 98,
+ -1, -1, 101, 44, 103, -1, 54, 55, -1, -1,
+ -1, -1, 60, 61, 62, 63, 64, 65, 66, 67,
+ 68, 69, 70, 71, 72, 73, 74, 75, 76, 77,
+ 78, 79, 80, 81, 82, -1, -1, 85, 86, 87,
+ 88, 89, 90, 91, 92, 93, -1, -1, -1, -1,
+ -1, -1, -1, -1, 95, -1, -1, 98, -1, -1,
+ 101, -1, 103
+};
+
+/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
+ symbol of state STATE-NUM. */
+static const unsigned char yystos[] =
+{
+ 0, 133, 134, 135, 0, 25, 31, 40, 41, 42,
+ 43, 120, 147, 149, 150, 156, 22, 24, 47, 53,
+ 119, 140, 150, 151, 56, 57, 58, 59, 121, 145,
+ 23, 157, 158, 30, 104, 148, 157, 48, 49, 50,
+ 137, 94, 20, 46, 120, 94, 145, 4, 5, 6,
+ 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
+ 18, 19, 20, 21, 44, 95, 98, 101, 103, 109,
+ 122, 123, 124, 125, 126, 140, 153, 29, 103, 146,
+ 119, 161, 94, 94, 94, 98, 138, 122, 32, 33,
+ 132, 132, 4, 4, 4, 8, 104, 126, 127, 140,
+ 96, 105, 34, 45, 54, 55, 60, 61, 62, 63,
+ 64, 65, 66, 67, 68, 69, 70, 71, 72, 73,
+ 74, 75, 76, 77, 78, 79, 80, 81, 82, 85,
+ 86, 87, 88, 89, 90, 91, 92, 93, 111, 112,
+ 113, 114, 159, 165, 166, 168, 169, 24, 51, 52,
+ 136, 4, 24, 139, 124, 9, 10, 11, 12, 13,
+ 14, 15, 16, 17, 18, 19, 115, 116, 118, 124,
+ 129, 99, 99, 104, 106, 96, 36, 127, 128, 124,
+ 155, 54, 8, 155, 9, 21, 10, 11, 12, 13,
+ 14, 15, 16, 17, 115, 116, 117, 121, 124, 124,
+ 155, 124, 124, 162, 155, 155, 155, 155, 155, 124,
+ 124, 124, 155, 121, 83, 84, 100, 106, 27, 28,
+ 3, 4, 110, 4, 7, 26, 37, 38, 85, 87,
+ 88, 98, 101, 103, 107, 111, 112, 113, 114, 130,
+ 153, 126, 126, 126, 36, 124, 142, 143, 144, 106,
+ 97, 3, 4, 7, 27, 28, 37, 38, 101, 130,
+ 152, 153, 154, 154, 154, 154, 122, 106, 106, 154,
+ 98, 106, 35, 106, 106, 106, 106, 154, 154, 154,
+ 106, 122, 124, 155, 24, 96, 96, 96, 100, 129,
+ 131, 131, 104, 131, 24, 96, 96, 96, 96, 100,
+ 102, 140, 141, 106, 97, 36, 131, 106, 106, 154,
+ 15, 15, 106, 167, 154, 98, 124, 155, 124, 124,
+ 124, 106, 106, 106, 155, 154, 154, 106, 129, 129,
+ 129, 100, 106, 102, 104, 129, 129, 129, 129, 36,
+ 142, 102, 21, 21, 96, 154, 154, 155, 163, 106,
+ 154, 106, 154, 154, 154, 96, 124, 167, 35, 106,
+ 129, 106, 106, 106, 106, 154, 154, 163, 164, 106,
+ 154, 106, 155, 164, 154, 97, 124, 129, 129, 129,
+ 129, 129, 106, 98, 97, 155, 100, 154, 97, 97,
+ 106, 97, 97, 97, 97, 21, 100, 117, 160, 35,
+ 100, 129, 154, 152, 100, 117, 21, 97, 106, 152,
+ 154, 21, 106, 64, 154, 21, 21, 154, 154
+};
+
+#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
+# define YYSIZE_T __SIZE_TYPE__
+#endif
+#if ! defined (YYSIZE_T) && defined (size_t)
+# define YYSIZE_T size_t
+#endif
+#if ! defined (YYSIZE_T)
+# if defined (__STDC__) || defined (__cplusplus)
+# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
+# define YYSIZE_T size_t
+# endif
+#endif
+#if ! defined (YYSIZE_T)
+# define YYSIZE_T unsigned int
+#endif
+
+#define yyerrok (yyerrstatus = 0)
+#define yyclearin (yychar = YYEMPTY)
+#define YYEMPTY (-2)
+#define YYEOF 0
+
+#define YYACCEPT goto yyacceptlab
+#define YYABORT goto yyabortlab
+#define YYERROR goto yyerrorlab
+
+
+/* Like YYERROR except do call yyerror. This remains here temporarily
+ to ease the transition to the new meaning of YYERROR, for GCC.
+ Once GCC version 2 has supplanted version 1, this can go. */
+
+#define YYFAIL goto yyerrlab
+
+#define YYRECOVERING() (!!yyerrstatus)
+
+#define YYBACKUP(Token, Value) \
+do \
+ if (yychar == YYEMPTY && yylen == 1) \
+ { \
+ yychar = (Token); \
+ yylval = (Value); \
+ yytoken = YYTRANSLATE (yychar); \
+ YYPOPSTACK; \
+ goto yybackup; \
+ } \
+ else \
+ { \
+ yyerror ("syntax error: cannot back up");\
+ YYERROR; \
+ } \
+while (0)
+
+#define YYTERROR 1
+#define YYERRCODE 256
+
+/* YYLLOC_DEFAULT -- Compute the default location (before the actions
+ are run). */
+
+#ifndef YYLLOC_DEFAULT
+# define YYLLOC_DEFAULT(Current, Rhs, N) \
+ ((Current).first_line = (Rhs)[1].first_line, \
+ (Current).first_column = (Rhs)[1].first_column, \
+ (Current).last_line = (Rhs)[N].last_line, \
+ (Current).last_column = (Rhs)[N].last_column)
+#endif
+
+/* YYLEX -- calling `yylex' with the right arguments. */
+
+#ifdef YYLEX_PARAM
+# define YYLEX yylex (YYLEX_PARAM)
+#else
+# define YYLEX yylex ()
+#endif
+
+/* Enable debugging if requested. */
+#if YYDEBUG
+
+# ifndef YYFPRINTF
+# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
+# define YYFPRINTF fprintf
+# endif
+
+# define YYDPRINTF(Args) \
+do { \
+ if (yydebug) \
+ YYFPRINTF Args; \
+} while (0)
+
+# define YYDSYMPRINT(Args) \
+do { \
+ if (yydebug) \
+ yysymprint Args; \
+} while (0)
+
+# define YYDSYMPRINTF(Title, Token, Value, Location) \
+do { \
+ if (yydebug) \
+ { \
+ YYFPRINTF (stderr, "%s ", Title); \
+ yysymprint (stderr, \
+ Token, Value); \
+ YYFPRINTF (stderr, "\n"); \
+ } \
+} while (0)
+
+/*------------------------------------------------------------------.
+| yy_stack_print -- Print the state stack from its BOTTOM up to its |
+| TOP (included). |
+`------------------------------------------------------------------*/
+
+#if defined (__STDC__) || defined (__cplusplus)
+static void
+yy_stack_print (short *bottom, short *top)
+#else
+static void
+yy_stack_print (bottom, top)
+ short *bottom;
+ short *top;
+#endif
+{
+ YYFPRINTF (stderr, "Stack now");
+ for (/* Nothing. */; bottom <= top; ++bottom)
+ YYFPRINTF (stderr, " %d", *bottom);
+ YYFPRINTF (stderr, "\n");
+}
+
+# define YY_STACK_PRINT(Bottom, Top) \
+do { \
+ if (yydebug) \
+ yy_stack_print ((Bottom), (Top)); \
+} while (0)
+
+
+/*------------------------------------------------.
+| Report that the YYRULE is going to be reduced. |
+`------------------------------------------------*/
+
+#if defined (__STDC__) || defined (__cplusplus)
+static void
+yy_reduce_print (int yyrule)
+#else
+static void
+yy_reduce_print (yyrule)
+ int yyrule;
+#endif
+{
+ int yyi;
+ unsigned int yylno = yyrline[yyrule];
+ YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ",
+ yyrule - 1, yylno);
+ /* Print the symbols being reduced, and their result. */
+ for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++)
+ YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]);
+ YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]);
+}
+
+# define YY_REDUCE_PRINT(Rule) \
+do { \
+ if (yydebug) \
+ yy_reduce_print (Rule); \
+} while (0)
+
+/* Nonzero means print parse trace. It is left uninitialized so that
+ multiple parsers can coexist. */
+int yydebug;
+#else /* !YYDEBUG */
+# define YYDPRINTF(Args)
+# define YYDSYMPRINT(Args)
+# define YYDSYMPRINTF(Title, Token, Value, Location)
+# define YY_STACK_PRINT(Bottom, Top)
+# define YY_REDUCE_PRINT(Rule)
+#endif /* !YYDEBUG */
+
+
+/* YYINITDEPTH -- initial size of the parser's stacks. */
+#ifndef YYINITDEPTH
+# define YYINITDEPTH 200
+#endif
+
+/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
+ if the built-in stack extension method is used).
+
+ Do not make this value too large; the results are undefined if
+ SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
+ evaluated with infinite-precision integer arithmetic. */
+
+#if defined (YYMAXDEPTH) && YYMAXDEPTH == 0
+# undef YYMAXDEPTH
+#endif
+
+#ifndef YYMAXDEPTH
+# define YYMAXDEPTH 10000
+#endif
+
+
+
+#if YYERROR_VERBOSE
+
+# ifndef yystrlen
+# if defined (__GLIBC__) && defined (_STRING_H)
+# define yystrlen strlen
+# else
+/* Return the length of YYSTR. */
+static YYSIZE_T
+# if defined (__STDC__) || defined (__cplusplus)
+yystrlen (const char *yystr)
+# else
+yystrlen (yystr)
+ const char *yystr;
+# endif
+{
+ register const char *yys = yystr;
+
+ while (*yys++ != '\0')
+ continue;
+
+ return yys - yystr - 1;
+}
+# endif
+# endif
+
+# ifndef yystpcpy
+# if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE)
+# define yystpcpy stpcpy
+# else
+/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
+ YYDEST. */
+static char *
+# if defined (__STDC__) || defined (__cplusplus)
+yystpcpy (char *yydest, const char *yysrc)
+# else
+yystpcpy (yydest, yysrc)
+ char *yydest;
+ const char *yysrc;
+# endif
+{
+ register char *yyd = yydest;
+ register const char *yys = yysrc;
+
+ while ((*yyd++ = *yys++) != '\0')
+ continue;
+
+ return yyd - 1;
+}
+# endif
+# endif
+
+#endif /* !YYERROR_VERBOSE */
+
+
+
+#if YYDEBUG
+/*--------------------------------.
+| Print this symbol on YYOUTPUT. |
+`--------------------------------*/
+
+#if defined (__STDC__) || defined (__cplusplus)
+static void
+yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep)
+#else
+static void
+yysymprint (yyoutput, yytype, yyvaluep)
+ FILE *yyoutput;
+ int yytype;
+ YYSTYPE *yyvaluep;
+#endif
+{
+ /* Pacify ``unused variable'' warnings. */
+ (void) yyvaluep;
+
+ if (yytype < YYNTOKENS)
+ {
+ YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
+# ifdef YYPRINT
+ YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
+# endif
+ }
+ else
+ YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
+
+ switch (yytype)
+ {
+ default:
+ break;
+ }
+ YYFPRINTF (yyoutput, ")");
+}
+
+#endif /* ! YYDEBUG */
+/*-----------------------------------------------.
+| Release the memory associated to this symbol. |
+`-----------------------------------------------*/
+
+#if defined (__STDC__) || defined (__cplusplus)
+static void
+yydestruct (int yytype, YYSTYPE *yyvaluep)
+#else
+static void
+yydestruct (yytype, yyvaluep)
+ int yytype;
+ YYSTYPE *yyvaluep;
+#endif
+{
+ /* Pacify ``unused variable'' warnings. */
+ (void) yyvaluep;
+
+ switch (yytype)
+ {
+
+ default:
+ break;
+ }
+}
+
+
+/* Prevent warnings from -Wmissing-prototypes. */
+
+#ifdef YYPARSE_PARAM
+# if defined (__STDC__) || defined (__cplusplus)
+int yyparse (void *YYPARSE_PARAM);
+# else
+int yyparse ();
+# endif
+#else /* ! YYPARSE_PARAM */
+#if defined (__STDC__) || defined (__cplusplus)
+int yyparse (void);
+#else
+int yyparse ();
+#endif
+#endif /* ! YYPARSE_PARAM */
+
+
+
+/* The lookahead symbol. */
+int yychar;
+
+/* The semantic value of the lookahead symbol. */
+YYSTYPE yylval;
+
+/* Number of syntax errors so far. */
+int yynerrs;
+
+
+
+/*----------.
+| yyparse. |
+`----------*/
+
+#ifdef YYPARSE_PARAM
+# if defined (__STDC__) || defined (__cplusplus)
+int yyparse (void *YYPARSE_PARAM)
+# else
+int yyparse (YYPARSE_PARAM)
+ void *YYPARSE_PARAM;
+# endif
+#else /* ! YYPARSE_PARAM */
+#if defined (__STDC__) || defined (__cplusplus)
+int
+yyparse (void)
+#else
+int
+yyparse ()
+
+#endif
+#endif
+{
+
+ register int yystate;
+ register int yyn;
+ int yyresult;
+ /* Number of tokens to shift before error messages enabled. */
+ int yyerrstatus;
+ /* Lookahead token as an internal (translated) token number. */
+ int yytoken = 0;
+
+ /* Three stacks and their tools:
+ `yyss': related to states,
+ `yyvs': related to semantic values,
+ `yyls': related to locations.
+
+ Refer to the stacks thru separate pointers, to allow yyoverflow
+ to reallocate them elsewhere. */
+
+ /* The state stack. */
+ short yyssa[YYINITDEPTH];
+ short *yyss = yyssa;
+ register short *yyssp;
+
+ /* The semantic value stack. */
+ YYSTYPE yyvsa[YYINITDEPTH];
+ YYSTYPE *yyvs = yyvsa;
+ register YYSTYPE *yyvsp;
+
+
+
+#define YYPOPSTACK (yyvsp--, yyssp--)
+
+ YYSIZE_T yystacksize = YYINITDEPTH;
+
+ /* The variables used to return semantic value and location from the
+ action routines. */
+ YYSTYPE yyval;
+
+
+ /* When reducing, the number of symbols on the RHS of the reduced
+ rule. */
+ int yylen;
+
+ YYDPRINTF ((stderr, "Starting parse\n"));
+
+ yystate = 0;
+ yyerrstatus = 0;
+ yynerrs = 0;
+ yychar = YYEMPTY; /* Cause a token to be read. */
+
+ /* Initialize stack pointers.
+ Waste one element of value and location stack
+ so that they stay on the same level as the state stack.
+ The wasted elements are never initialized. */
+
+ yyssp = yyss;
+ yyvsp = yyvs;
+
+ goto yysetstate;
+
+/*------------------------------------------------------------.
+| yynewstate -- Push a new state, which is found in yystate. |
+`------------------------------------------------------------*/
+ yynewstate:
+ /* In all cases, when you get here, the value and location stacks
+ have just been pushed. so pushing a state here evens the stacks.
+ */
+ yyssp++;
+
+ yysetstate:
+ *yyssp = yystate;
+
+ if (yyss + yystacksize - 1 <= yyssp)
+ {
+ /* Get the current used size of the three stacks, in elements. */
+ YYSIZE_T yysize = yyssp - yyss + 1;
+
+#ifdef yyoverflow
+ {
+ /* Give user a chance to reallocate the stack. Use copies of
+ these so that the &'s don't force the real ones into
+ memory. */
+ YYSTYPE *yyvs1 = yyvs;
+ short *yyss1 = yyss;
+
+
+ /* Each stack pointer address is followed by the size of the
+ data in use in that stack, in bytes. This used to be a
+ conditional around just the two extra args, but that might
+ be undefined if yyoverflow is a macro. */
+ yyoverflow ("parser stack overflow",
+ &yyss1, yysize * sizeof (*yyssp),
+ &yyvs1, yysize * sizeof (*yyvsp),
+
+ &yystacksize);
+
+ yyss = yyss1;
+ yyvs = yyvs1;
+ }
+#else /* no yyoverflow */
+# ifndef YYSTACK_RELOCATE
+ goto yyoverflowlab;
+# else
+ /* Extend the stack our own way. */
+ if (YYMAXDEPTH <= yystacksize)
+ goto yyoverflowlab;
+ yystacksize *= 2;
+ if (YYMAXDEPTH < yystacksize)
+ yystacksize = YYMAXDEPTH;
+
+ {
+ short *yyss1 = yyss;
+ union yyalloc *yyptr =
+ (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
+ if (! yyptr)
+ goto yyoverflowlab;
+ YYSTACK_RELOCATE (yyss);
+ YYSTACK_RELOCATE (yyvs);
+
+# undef YYSTACK_RELOCATE
+ if (yyss1 != yyssa)
+ YYSTACK_FREE (yyss1);
+ }
+# endif
+#endif /* no yyoverflow */
+
+ yyssp = yyss + yysize - 1;
+ yyvsp = yyvs + yysize - 1;
+
+
+ YYDPRINTF ((stderr, "Stack size increased to %lu\n",
+ (unsigned long int) yystacksize));
+
+ if (yyss + yystacksize - 1 <= yyssp)
+ YYABORT;
+ }
+
+ YYDPRINTF ((stderr, "Entering state %d\n", yystate));
+
+ goto yybackup;
+
+/*-----------.
+| yybackup. |
+`-----------*/
+yybackup:
+
+/* Do appropriate processing given the current state. */
+/* Read a lookahead token if we need one and don't already have one. */
+/* yyresume: */
+
+ /* First try to decide what to do without reference to lookahead token. */
+
+ yyn = yypact[yystate];
+ if (yyn == YYPACT_NINF)
+ goto yydefault;
+
+ /* Not known => get a lookahead token if don't already have one. */
+
+ /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
+ if (yychar == YYEMPTY)
+ {
+ YYDPRINTF ((stderr, "Reading a token: "));
+ yychar = YYLEX;
+ }
+
+ if (yychar <= YYEOF)
+ {
+ yychar = yytoken = YYEOF;
+ YYDPRINTF ((stderr, "Now at end of input.\n"));
+ }
+ else
+ {
+ yytoken = YYTRANSLATE (yychar);
+ YYDSYMPRINTF ("Next token is", yytoken, &yylval, &yylloc);
+ }
+
+ /* If the proper action on seeing token YYTOKEN is to reduce or to
+ detect an error, take that action. */
+ yyn += yytoken;
+ if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
+ goto yydefault;
+ yyn = yytable[yyn];
+ if (yyn <= 0)
+ {
+ if (yyn == 0 || yyn == YYTABLE_NINF)
+ goto yyerrlab;
+ yyn = -yyn;
+ goto yyreduce;
+ }
+
+ if (yyn == YYFINAL)
+ YYACCEPT;
+
+ /* Shift the lookahead token. */
+ YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken]));
+
+ /* Discard the token being shifted unless it is eof. */
+ if (yychar != YYEOF)
+ yychar = YYEMPTY;
+
+ *++yyvsp = yylval;
+
+
+ /* Count tokens shifted since error; after three, turn off error
+ status. */
+ if (yyerrstatus)
+ yyerrstatus--;
+
+ yystate = yyn;
+ goto yynewstate;
+
+
+/*-----------------------------------------------------------.
+| yydefault -- do the default action for the current state. |
+`-----------------------------------------------------------*/
+yydefault:
+ yyn = yydefact[yystate];
+ if (yyn == 0)
+ goto yyerrlab;
+ goto yyreduce;
+
+
+/*-----------------------------.
+| yyreduce -- Do a reduction. |
+`-----------------------------*/
+yyreduce:
+ /* yyn is the number of a rule to reduce with. */
+ yylen = yyr2[yyn];
+
+ /* If YYLEN is nonzero, implement the default value of the action:
+ `$$ = $1'.
+
+ Otherwise, the following line sets YYVAL to garbage.
+ This behavior is undocumented and Bison
+ users should not rely upon it. Assigning to YYVAL
+ unconditionally makes the parser a bit smaller, and it avoids a
+ GCC warning that YYVAL may be used uninitialized. */
+ yyval = yyvsp[1-yylen];
+
+
+ YY_REDUCE_PRINT (yyn);
+ switch (yyn)
+ {
+ case 3:
+#line 983 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[0].UIntVal > (uint32_t)INT32_MAX) // Outside of my range!
+ ThrowException("Value too large for type!");
+ yyval.SIntVal = (int32_t)yyvsp[0].UIntVal;
+;}
+ break;
+
+ case 5:
+#line 991 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[0].UInt64Val > (uint64_t)INT64_MAX) // Outside of my range!
+ ThrowException("Value too large for type!");
+ yyval.SInt64Val = (int64_t)yyvsp[0].UInt64Val;
+;}
+ break;
+
+ case 34:
+#line 1014 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.StrVal = yyvsp[-1].StrVal;
+ ;}
+ break;
+
+ case 35:
+#line 1017 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.StrVal = 0;
+ ;}
+ break;
+
+ case 36:
+#line 1021 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Linkage = GlobalValue::InternalLinkage; ;}
+ break;
+
+ case 37:
+#line 1022 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Linkage = GlobalValue::LinkOnceLinkage; ;}
+ break;
+
+ case 38:
+#line 1023 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Linkage = GlobalValue::WeakLinkage; ;}
+ break;
+
+ case 39:
+#line 1024 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Linkage = GlobalValue::AppendingLinkage; ;}
+ break;
+
+ case 40:
+#line 1025 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Linkage = GlobalValue::ExternalLinkage; ;}
+ break;
+
+ case 41:
+#line 1027 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.UIntVal = CallingConv::C; ;}
+ break;
+
+ case 42:
+#line 1028 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.UIntVal = CallingConv::C; ;}
+ break;
+
+ case 43:
+#line 1029 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.UIntVal = CallingConv::Fast; ;}
+ break;
+
+ case 44:
+#line 1030 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.UIntVal = CallingConv::Cold; ;}
+ break;
+
+ case 45:
+#line 1031 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if ((unsigned)yyvsp[0].UInt64Val != yyvsp[0].UInt64Val)
+ ThrowException("Calling conv too large!");
+ yyval.UIntVal = yyvsp[0].UInt64Val;
+ ;}
+ break;
+
+ case 47:
+#line 1044 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType); ;}
+ break;
+
+ case 49:
+#line 1045 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType); ;}
+ break;
+
+ case 50:
+#line 1047 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!UpRefs.empty())
+ ThrowException("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
+ yyval.TypeVal = yyvsp[0].TypeVal;
+ ;}
+ break;
+
+ case 64:
+#line 1058 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TypeVal = new PATypeHolder(OpaqueType::get());
+ ;}
+ break;
+
+ case 65:
+#line 1061 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType);
+ ;}
+ break;
+
+ case 66:
+#line 1064 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Named types are also simple types...
+ yyval.TypeVal = new PATypeHolder(getTypeVal(yyvsp[0].ValIDVal));
+;}
+ break;
+
+ case 67:
+#line 1070 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Type UpReference
+ if (yyvsp[0].UInt64Val > (uint64_t)~0U) ThrowException("Value out of range!");
+ OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
+ UpRefs.push_back(UpRefRecord((unsigned)yyvsp[0].UInt64Val, OT)); // Add to vector...
+ yyval.TypeVal = new PATypeHolder(OT);
+ UR_OUT("New Upreference!\n");
+ ;}
+ break;
+
+ case 68:
+#line 1077 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Function derived type?
+ std::vector<const Type*> Params;
+ for (std::list<llvm::PATypeHolder>::iterator I = yyvsp[-1].TypeList->begin(),
+ E = yyvsp[-1].TypeList->end(); I != E; ++I)
+ Params.push_back(*I);
+ bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
+ if (isVarArg) Params.pop_back();
+
+ yyval.TypeVal = new PATypeHolder(HandleUpRefs(FunctionType::get(*yyvsp[-3].TypeVal,Params,isVarArg)));
+ delete yyvsp[-1].TypeList; // Delete the argument list
+ delete yyvsp[-3].TypeVal; // Delete the return type handle
+ ;}
+ break;
+
+ case 69:
+#line 1089 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Sized array type?
+ yyval.TypeVal = new PATypeHolder(HandleUpRefs(ArrayType::get(*yyvsp[-1].TypeVal, (unsigned)yyvsp[-3].UInt64Val)));
+ delete yyvsp[-1].TypeVal;
+ ;}
+ break;
+
+ case 70:
+#line 1093 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Packed array type?
+ const llvm::Type* ElemTy = yyvsp[-1].TypeVal->get();
+ if ((unsigned)yyvsp[-3].UInt64Val != yyvsp[-3].UInt64Val) {
+ ThrowException("Unsigned result not equal to signed result");
+ }
+ if(!ElemTy->isPrimitiveType()) {
+ ThrowException("Elemental type of a PackedType must be primitive");
+ }
+ yyval.TypeVal = new PATypeHolder(HandleUpRefs(PackedType::get(*yyvsp[-1].TypeVal, (unsigned)yyvsp[-3].UInt64Val)));
+ delete yyvsp[-1].TypeVal;
+ ;}
+ break;
+
+ case 71:
+#line 1104 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Structure type?
+ std::vector<const Type*> Elements;
+ for (std::list<llvm::PATypeHolder>::iterator I = yyvsp[-1].TypeList->begin(),
+ E = yyvsp[-1].TypeList->end(); I != E; ++I)
+ Elements.push_back(*I);
+
+ yyval.TypeVal = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
+ delete yyvsp[-1].TypeList;
+ ;}
+ break;
+
+ case 72:
+#line 1113 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Empty structure type?
+ yyval.TypeVal = new PATypeHolder(StructType::get(std::vector<const Type*>()));
+ ;}
+ break;
+
+ case 73:
+#line 1116 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Pointer type?
+ yyval.TypeVal = new PATypeHolder(HandleUpRefs(PointerType::get(*yyvsp[-1].TypeVal)));
+ delete yyvsp[-1].TypeVal;
+ ;}
+ break;
+
+ case 74:
+#line 1124 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TypeList = new std::list<PATypeHolder>();
+ yyval.TypeList->push_back(*yyvsp[0].TypeVal); delete yyvsp[0].TypeVal;
+ ;}
+ break;
+
+ case 75:
+#line 1128 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ (yyval.TypeList=yyvsp[-2].TypeList)->push_back(*yyvsp[0].TypeVal); delete yyvsp[0].TypeVal;
+ ;}
+ break;
+
+ case 77:
+#line 1134 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ (yyval.TypeList=yyvsp[-2].TypeList)->push_back(Type::VoidTy);
+ ;}
+ break;
+
+ case 78:
+#line 1137 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ (yyval.TypeList = new std::list<PATypeHolder>())->push_back(Type::VoidTy);
+ ;}
+ break;
+
+ case 79:
+#line 1140 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TypeList = new std::list<PATypeHolder>();
+ ;}
+ break;
+
+ case 80:
+#line 1150 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Nonempty unsized arr
+ const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-3].TypeVal->get());
+ if (ATy == 0)
+ ThrowException("Cannot make array constant with type: '" +
+ (*yyvsp[-3].TypeVal)->getDescription() + "'!");
+ const Type *ETy = ATy->getElementType();
+ int NumElements = ATy->getNumElements();
+
+ // Verify that we have the correct size...
+ if (NumElements != -1 && NumElements != (int)yyvsp[-1].ConstVector->size())
+ ThrowException("Type mismatch: constant sized array initialized with " +
+ utostr(yyvsp[-1].ConstVector->size()) + " arguments, but has size of " +
+ itostr(NumElements) + "!");
+
+ // Verify all elements are correct type!
+ for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) {
+ if (ETy != (*yyvsp[-1].ConstVector)[i]->getType())
+ ThrowException("Element #" + utostr(i) + " is not of type '" +
+ ETy->getDescription() +"' as required!\nIt is of type '"+
+ (*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'.");
+ }
+
+ yyval.ConstVal = ConstantArray::get(ATy, *yyvsp[-1].ConstVector);
+ delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
+ ;}
+ break;
+
+ case 81:
+#line 1175 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get());
+ if (ATy == 0)
+ ThrowException("Cannot make array constant with type: '" +
+ (*yyvsp[-2].TypeVal)->getDescription() + "'!");
+
+ int NumElements = ATy->getNumElements();
+ if (NumElements != -1 && NumElements != 0)
+ ThrowException("Type mismatch: constant sized array initialized with 0"
+ " arguments, but has size of " + itostr(NumElements) +"!");
+ yyval.ConstVal = ConstantArray::get(ATy, std::vector<Constant*>());
+ delete yyvsp[-2].TypeVal;
+ ;}
+ break;
+
+ case 82:
+#line 1188 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get());
+ if (ATy == 0)
+ ThrowException("Cannot make array constant with type: '" +
+ (*yyvsp[-2].TypeVal)->getDescription() + "'!");
+
+ int NumElements = ATy->getNumElements();
+ const Type *ETy = ATy->getElementType();
+ char *EndStr = UnEscapeLexed(yyvsp[0].StrVal, true);
+ if (NumElements != -1 && NumElements != (EndStr-yyvsp[0].StrVal))
+ ThrowException("Can't build string constant of size " +
+ itostr((int)(EndStr-yyvsp[0].StrVal)) +
+ " when array has size " + itostr(NumElements) + "!");
+ std::vector<Constant*> Vals;
+ if (ETy == Type::SByteTy) {
+ for (char *C = yyvsp[0].StrVal; C != EndStr; ++C)
+ Vals.push_back(ConstantSInt::get(ETy, *C));
+ } else if (ETy == Type::UByteTy) {
+ for (char *C = yyvsp[0].StrVal; C != EndStr; ++C)
+ Vals.push_back(ConstantUInt::get(ETy, (unsigned char)*C));
+ } else {
+ free(yyvsp[0].StrVal);
+ ThrowException("Cannot build string arrays of non byte sized elements!");
+ }
+ free(yyvsp[0].StrVal);
+ yyval.ConstVal = ConstantArray::get(ATy, Vals);
+ delete yyvsp[-2].TypeVal;
+ ;}
+ break;
+
+ case 83:
+#line 1216 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Nonempty unsized arr
+ const PackedType *PTy = dyn_cast<PackedType>(yyvsp[-3].TypeVal->get());
+ if (PTy == 0)
+ ThrowException("Cannot make packed constant with type: '" +
+ (*yyvsp[-3].TypeVal)->getDescription() + "'!");
+ const Type *ETy = PTy->getElementType();
+ int NumElements = PTy->getNumElements();
+
+ // Verify that we have the correct size...
+ if (NumElements != -1 && NumElements != (int)yyvsp[-1].ConstVector->size())
+ ThrowException("Type mismatch: constant sized packed initialized with " +
+ utostr(yyvsp[-1].ConstVector->size()) + " arguments, but has size of " +
+ itostr(NumElements) + "!");
+
+ // Verify all elements are correct type!
+ for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) {
+ if (ETy != (*yyvsp[-1].ConstVector)[i]->getType())
+ ThrowException("Element #" + utostr(i) + " is not of type '" +
+ ETy->getDescription() +"' as required!\nIt is of type '"+
+ (*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'.");
+ }
+
+ yyval.ConstVal = ConstantPacked::get(PTy, *yyvsp[-1].ConstVector);
+ delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
+ ;}
+ break;
+
+ case 84:
+#line 1241 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const StructType *STy = dyn_cast<StructType>(yyvsp[-3].TypeVal->get());
+ if (STy == 0)
+ ThrowException("Cannot make struct constant with type: '" +
+ (*yyvsp[-3].TypeVal)->getDescription() + "'!");
+
+ if (yyvsp[-1].ConstVector->size() != STy->getNumContainedTypes())
+ ThrowException("Illegal number of initializers for structure type!");
+
+ // Check to ensure that constants are compatible with the type initializer!
+ for (unsigned i = 0, e = yyvsp[-1].ConstVector->size(); i != e; ++i)
+ if ((*yyvsp[-1].ConstVector)[i]->getType() != STy->getElementType(i))
+ ThrowException("Expected type '" +
+ STy->getElementType(i)->getDescription() +
+ "' for element #" + utostr(i) +
+ " of structure initializer!");
+
+ yyval.ConstVal = ConstantStruct::get(STy, *yyvsp[-1].ConstVector);
+ delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
+ ;}
+ break;
+
+ case 85:
+#line 1261 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const StructType *STy = dyn_cast<StructType>(yyvsp[-2].TypeVal->get());
+ if (STy == 0)
+ ThrowException("Cannot make struct constant with type: '" +
+ (*yyvsp[-2].TypeVal)->getDescription() + "'!");
+
+ if (STy->getNumContainedTypes() != 0)
+ ThrowException("Illegal number of initializers for structure type!");
+
+ yyval.ConstVal = ConstantStruct::get(STy, std::vector<Constant*>());
+ delete yyvsp[-2].TypeVal;
+ ;}
+ break;
+
+ case 86:
+#line 1273 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const PointerType *PTy = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
+ if (PTy == 0)
+ ThrowException("Cannot make null pointer constant with type: '" +
+ (*yyvsp[-1].TypeVal)->getDescription() + "'!");
+
+ yyval.ConstVal = ConstantPointerNull::get(PTy);
+ delete yyvsp[-1].TypeVal;
+ ;}
+ break;
+
+ case 87:
+#line 1282 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ConstVal = UndefValue::get(yyvsp[-1].TypeVal->get());
+ delete yyvsp[-1].TypeVal;
+ ;}
+ break;
+
+ case 88:
+#line 1286 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const PointerType *Ty = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
+ if (Ty == 0)
+ ThrowException("Global const reference must be a pointer type!");
+
+ // ConstExprs can exist in the body of a function, thus creating
+ // GlobalValues whenever they refer to a variable. Because we are in
+ // the context of a function, getValNonImprovising will search the functions
+ // symbol table instead of the module symbol table for the global symbol,
+ // which throws things all off. To get around this, we just tell
+ // getValNonImprovising that we are at global scope here.
+ //
+ Function *SavedCurFn = CurFun.CurrentFunction;
+ CurFun.CurrentFunction = 0;
+
+ Value *V = getValNonImprovising(Ty, yyvsp[0].ValIDVal);
+
+ CurFun.CurrentFunction = SavedCurFn;
+
+ // If this is an initializer for a constant pointer, which is referencing a
+ // (currently) undefined variable, create a stub now that shall be replaced
+ // in the future with the right type of variable.
+ //
+ if (V == 0) {
+ assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
+ const PointerType *PT = cast<PointerType>(Ty);
+
+ // First check to see if the forward references value is already created!
+ PerModuleInfo::GlobalRefsType::iterator I =
+ CurModule.GlobalRefs.find(std::make_pair(PT, yyvsp[0].ValIDVal));
+
+ if (I != CurModule.GlobalRefs.end()) {
+ V = I->second; // Placeholder already exists, use it...
+ yyvsp[0].ValIDVal.destroy();
+ } else {
+ std::string Name;
+ if (yyvsp[0].ValIDVal.Type == ValID::NameVal) Name = yyvsp[0].ValIDVal.Name;
+
+ // Create the forward referenced global.
+ GlobalValue *GV;
+ if (const FunctionType *FTy =
+ dyn_cast<FunctionType>(PT->getElementType())) {
+ GV = new Function(FTy, GlobalValue::ExternalLinkage, Name,
+ CurModule.CurrentModule);
+ } else {
+ GV = new GlobalVariable(PT->getElementType(), false,
+ GlobalValue::ExternalLinkage, 0,
+ Name, CurModule.CurrentModule);
+ }
+
+ // Keep track of the fact that we have a forward ref to recycle it
+ CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, yyvsp[0].ValIDVal), GV));
+ V = GV;
+ }
+ }
+
+ yyval.ConstVal = cast<GlobalValue>(V);
+ delete yyvsp[-1].TypeVal; // Free the type handle
+ ;}
+ break;
+
+ case 89:
+#line 1345 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-1].TypeVal->get() != yyvsp[0].ConstVal->getType())
+ ThrowException("Mismatched types for constant expression!");
+ yyval.ConstVal = yyvsp[0].ConstVal;
+ delete yyvsp[-1].TypeVal;
+ ;}
+ break;
+
+ case 90:
+#line 1351 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const Type *Ty = yyvsp[-1].TypeVal->get();
+ if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
+ ThrowException("Cannot create a null initialized value of this type!");
+ yyval.ConstVal = Constant::getNullValue(Ty);
+ delete yyvsp[-1].TypeVal;
+ ;}
+ break;
+
+ case 91:
+#line 1359 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // integral constants
+ if (!ConstantSInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].SInt64Val))
+ ThrowException("Constant value doesn't fit in type!");
+ yyval.ConstVal = ConstantSInt::get(yyvsp[-1].PrimType, yyvsp[0].SInt64Val);
+ ;}
+ break;
+
+ case 92:
+#line 1364 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // integral constants
+ if (!ConstantUInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].UInt64Val))
+ ThrowException("Constant value doesn't fit in type!");
+ yyval.ConstVal = ConstantUInt::get(yyvsp[-1].PrimType, yyvsp[0].UInt64Val);
+ ;}
+ break;
+
+ case 93:
+#line 1369 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Boolean constants
+ yyval.ConstVal = ConstantBool::True;
+ ;}
+ break;
+
+ case 94:
+#line 1372 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Boolean constants
+ yyval.ConstVal = ConstantBool::False;
+ ;}
+ break;
+
+ case 95:
+#line 1375 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Float & Double constants
+ if (!ConstantFP::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].FPVal))
+ ThrowException("Floating point constant invalid for type!!");
+ yyval.ConstVal = ConstantFP::get(yyvsp[-1].PrimType, yyvsp[0].FPVal);
+ ;}
+ break;
+
+ case 96:
+#line 1382 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!yyvsp[-3].ConstVal->getType()->isFirstClassType())
+ ThrowException("cast constant expression from a non-primitive type: '" +
+ yyvsp[-3].ConstVal->getType()->getDescription() + "'!");
+ if (!yyvsp[-1].TypeVal->get()->isFirstClassType())
+ ThrowException("cast constant expression to a non-primitive type: '" +
+ yyvsp[-1].TypeVal->get()->getDescription() + "'!");
+ yyval.ConstVal = ConstantExpr::getCast(yyvsp[-3].ConstVal, yyvsp[-1].TypeVal->get());
+ delete yyvsp[-1].TypeVal;
+ ;}
+ break;
+
+ case 97:
+#line 1392 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!isa<PointerType>(yyvsp[-2].ConstVal->getType()))
+ ThrowException("GetElementPtr requires a pointer operand!");
+
+ // LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte struct
+ // indices to uint struct indices for compatibility.
+ generic_gep_type_iterator<std::vector<Value*>::iterator>
+ GTI = gep_type_begin(yyvsp[-2].ConstVal->getType(), yyvsp[-1].ValueList->begin(), yyvsp[-1].ValueList->end()),
+ GTE = gep_type_end(yyvsp[-2].ConstVal->getType(), yyvsp[-1].ValueList->begin(), yyvsp[-1].ValueList->end());
+ for (unsigned i = 0, e = yyvsp[-1].ValueList->size(); i != e && GTI != GTE; ++i, ++GTI)
+ if (isa<StructType>(*GTI)) // Only change struct indices
+ if (ConstantUInt *CUI = dyn_cast<ConstantUInt>((*yyvsp[-1].ValueList)[i]))
+ if (CUI->getType() == Type::UByteTy)
+ (*yyvsp[-1].ValueList)[i] = ConstantExpr::getCast(CUI, Type::UIntTy);
+
+ const Type *IdxTy =
+ GetElementPtrInst::getIndexedType(yyvsp[-2].ConstVal->getType(), *yyvsp[-1].ValueList, true);
+ if (!IdxTy)
+ ThrowException("Index list invalid for constant getelementptr!");
+
+ std::vector<Constant*> IdxVec;
+ for (unsigned i = 0, e = yyvsp[-1].ValueList->size(); i != e; ++i)
+ if (Constant *C = dyn_cast<Constant>((*yyvsp[-1].ValueList)[i]))
+ IdxVec.push_back(C);
+ else
+ ThrowException("Indices to constant getelementptr must be constants!");
+
+ delete yyvsp[-1].ValueList;
+
+ yyval.ConstVal = ConstantExpr::getGetElementPtr(yyvsp[-2].ConstVal, IdxVec);
+ ;}
+ break;
+
+ case 98:
+#line 1423 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-5].ConstVal->getType() != Type::BoolTy)
+ ThrowException("Select condition must be of boolean type!");
+ if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
+ ThrowException("Select operand types must match!");
+ yyval.ConstVal = ConstantExpr::getSelect(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
+ ;}
+ break;
+
+ case 99:
+#line 1430 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
+ ThrowException("Binary operator types must match!");
+ // HACK: llvm 1.3 and earlier used to emit invalid pointer constant exprs.
+ // To retain backward compatibility with these early compilers, we emit a
+ // cast to the appropriate integer type automatically if we are in the
+ // broken case. See PR424 for more information.
+ if (!isa<PointerType>(yyvsp[-3].ConstVal->getType())) {
+ yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
+ } else {
+ const Type *IntPtrTy = 0;
+ switch (CurModule.CurrentModule->getPointerSize()) {
+ case Module::Pointer32: IntPtrTy = Type::IntTy; break;
+ case Module::Pointer64: IntPtrTy = Type::LongTy; break;
+ default: ThrowException("invalid pointer binary constant expr!");
+ }
+ yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, ConstantExpr::getCast(yyvsp[-3].ConstVal, IntPtrTy),
+ ConstantExpr::getCast(yyvsp[-1].ConstVal, IntPtrTy));
+ yyval.ConstVal = ConstantExpr::getCast(yyval.ConstVal, yyvsp[-3].ConstVal->getType());
+ }
+ ;}
+ break;
+
+ case 100:
+#line 1451 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
+ ThrowException("Logical operator types must match!");
+ if (!yyvsp[-3].ConstVal->getType()->isIntegral())
+ ThrowException("Logical operands must have integral types!");
+ yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
+ ;}
+ break;
+
+ case 101:
+#line 1458 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
+ ThrowException("setcc operand types must match!");
+ yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
+ ;}
+ break;
+
+ case 102:
+#line 1463 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-1].ConstVal->getType() != Type::UByteTy)
+ ThrowException("Shift count for shift constant must be unsigned byte!");
+ if (!yyvsp[-3].ConstVal->getType()->isInteger())
+ ThrowException("Shift constant expression requires integer operand!");
+ yyval.ConstVal = ConstantExpr::get(yyvsp[-5].OtherOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
+ ;}
+ break;
+
+ case 103:
+#line 1473 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ (yyval.ConstVector = yyvsp[-2].ConstVector)->push_back(yyvsp[0].ConstVal);
+ ;}
+ break;
+
+ case 104:
+#line 1476 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ConstVector = new std::vector<Constant*>();
+ yyval.ConstVector->push_back(yyvsp[0].ConstVal);
+ ;}
+ break;
+
+ case 105:
+#line 1483 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.BoolVal = false; ;}
+ break;
+
+ case 106:
+#line 1483 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.BoolVal = true; ;}
+ break;
+
+ case 107:
+#line 1493 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ModuleVal = ParserResult = yyvsp[0].ModuleVal;
+ CurModule.ModuleDone();
+;}
+ break;
+
+ case 108:
+#line 1500 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ModuleVal = yyvsp[-1].ModuleVal;
+ CurFun.FunctionDone();
+ ;}
+ break;
+
+ case 109:
+#line 1504 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ModuleVal = yyvsp[-1].ModuleVal;
+ ;}
+ break;
+
+ case 110:
+#line 1507 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ModuleVal = yyvsp[-1].ModuleVal;
+ ;}
+ break;
+
+ case 111:
+#line 1510 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ModuleVal = CurModule.CurrentModule;
+ // Emit an error if there are any unresolved types left.
+ if (!CurModule.LateResolveTypes.empty()) {
+ const ValID &DID = CurModule.LateResolveTypes.begin()->first;
+ if (DID.Type == ValID::NameVal)
+ ThrowException("Reference to an undefined type: '"+DID.getName() + "'");
+ else
+ ThrowException("Reference to an undefined type: #" + itostr(DID.Num));
+ }
+ ;}
+ break;
+
+ case 112:
+#line 1523 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ // Eagerly resolve types. This is not an optimization, this is a
+ // requirement that is due to the fact that we could have this:
+ //
+ // %list = type { %list * }
+ // %list = type { %list * } ; repeated type decl
+ //
+ // If types are not resolved eagerly, then the two types will not be
+ // determined to be the same type!
+ //
+ ResolveTypeTo(yyvsp[-2].StrVal, *yyvsp[0].TypeVal);
+
+ if (!setTypeName(*yyvsp[0].TypeVal, yyvsp[-2].StrVal) && !yyvsp[-2].StrVal) {
+ // If this is a named type that is not a redefinition, add it to the slot
+ // table.
+ CurModule.Types.push_back(*yyvsp[0].TypeVal);
+ }
+
+ delete yyvsp[0].TypeVal;
+ ;}
+ break;
+
+ case 113:
+#line 1543 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Function prototypes can be in const pool
+ ;}
+ break;
+
+ case 114:
+#line 1545 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[0].ConstVal == 0) ThrowException("Global value initializer is not a constant!");
+ ParseGlobalVariable(yyvsp[-3].StrVal, yyvsp[-2].Linkage, yyvsp[-1].BoolVal, yyvsp[0].ConstVal->getType(), yyvsp[0].ConstVal);
+ ;}
+ break;
+
+ case 115:
+#line 1549 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ ParseGlobalVariable(yyvsp[-3].StrVal, GlobalValue::ExternalLinkage, yyvsp[-1].BoolVal, *yyvsp[0].TypeVal, 0);
+ delete yyvsp[0].TypeVal;
+ ;}
+ break;
+
+ case 116:
+#line 1553 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ ;}
+ break;
+
+ case 117:
+#line 1555 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ ;}
+ break;
+
+ case 118:
+#line 1557 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ ;}
+ break;
+
+ case 119:
+#line 1562 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Endianness = Module::BigEndian; ;}
+ break;
+
+ case 120:
+#line 1563 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Endianness = Module::LittleEndian; ;}
+ break;
+
+ case 121:
+#line 1565 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ CurModule.CurrentModule->setEndianness(yyvsp[0].Endianness);
+ ;}
+ break;
+
+ case 122:
+#line 1568 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[0].UInt64Val == 32)
+ CurModule.CurrentModule->setPointerSize(Module::Pointer32);
+ else if (yyvsp[0].UInt64Val == 64)
+ CurModule.CurrentModule->setPointerSize(Module::Pointer64);
+ else
+ ThrowException("Invalid pointer size: '" + utostr(yyvsp[0].UInt64Val) + "'!");
+ ;}
+ break;
+
+ case 123:
+#line 1576 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ CurModule.CurrentModule->setTargetTriple(yyvsp[0].StrVal);
+ free(yyvsp[0].StrVal);
+ ;}
+ break;
+
+ case 125:
+#line 1583 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal);
+ free(yyvsp[0].StrVal);
+ ;}
+ break;
+
+ case 126:
+#line 1587 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal);
+ free(yyvsp[0].StrVal);
+ ;}
+ break;
+
+ case 127:
+#line 1591 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ ;}
+ break;
+
+ case 131:
+#line 1600 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.StrVal = 0; ;}
+ break;
+
+ case 132:
+#line 1602 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (*yyvsp[-1].TypeVal == Type::VoidTy)
+ ThrowException("void typed arguments are invalid!");
+ yyval.ArgVal = new std::pair<PATypeHolder*, char*>(yyvsp[-1].TypeVal, yyvsp[0].StrVal);
+;}
+ break;
+
+ case 133:
+#line 1608 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ArgList = yyvsp[-2].ArgList;
+ yyvsp[-2].ArgList->push_back(*yyvsp[0].ArgVal);
+ delete yyvsp[0].ArgVal;
+ ;}
+ break;
+
+ case 134:
+#line 1613 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ArgList = new std::vector<std::pair<PATypeHolder*,char*> >();
+ yyval.ArgList->push_back(*yyvsp[0].ArgVal);
+ delete yyvsp[0].ArgVal;
+ ;}
+ break;
+
+ case 135:
+#line 1619 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ArgList = yyvsp[0].ArgList;
+ ;}
+ break;
+
+ case 136:
+#line 1622 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ArgList = yyvsp[-2].ArgList;
+ yyval.ArgList->push_back(std::pair<PATypeHolder*,
+ char*>(new PATypeHolder(Type::VoidTy), 0));
+ ;}
+ break;
+
+ case 137:
+#line 1627 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ArgList = new std::vector<std::pair<PATypeHolder*,char*> >();
+ yyval.ArgList->push_back(std::make_pair(new PATypeHolder(Type::VoidTy), (char*)0));
+ ;}
+ break;
+
+ case 138:
+#line 1631 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ArgList = 0;
+ ;}
+ break;
+
+ case 139:
+#line 1635 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ UnEscapeLexed(yyvsp[-3].StrVal);
+ std::string FunctionName(yyvsp[-3].StrVal);
+ free(yyvsp[-3].StrVal); // Free strdup'd memory!
+
+ if (!(*yyvsp[-4].TypeVal)->isFirstClassType() && *yyvsp[-4].TypeVal != Type::VoidTy)
+ ThrowException("LLVM functions cannot return aggregate types!");
+
+ std::vector<const Type*> ParamTypeList;
+ if (yyvsp[-1].ArgList) { // If there are arguments...
+ for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = yyvsp[-1].ArgList->begin();
+ I != yyvsp[-1].ArgList->end(); ++I)
+ ParamTypeList.push_back(I->first->get());
+ }
+
+ bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
+ if (isVarArg) ParamTypeList.pop_back();
+
+ const FunctionType *FT = FunctionType::get(*yyvsp[-4].TypeVal, ParamTypeList, isVarArg);
+ const PointerType *PFT = PointerType::get(FT);
+ delete yyvsp[-4].TypeVal;
+
+ ValID ID;
+ if (!FunctionName.empty()) {
+ ID = ValID::create((char*)FunctionName.c_str());
+ } else {
+ ID = ValID::create((int)CurModule.Values[PFT].size());
+ }
+
+ Function *Fn = 0;
+ // See if this function was forward referenced. If so, recycle the object.
+ if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
+ // Move the function to the end of the list, from whereever it was
+ // previously inserted.
+ Fn = cast<Function>(FWRef);
+ CurModule.CurrentModule->getFunctionList().remove(Fn);
+ CurModule.CurrentModule->getFunctionList().push_back(Fn);
+ } else if (!FunctionName.empty() && // Merge with an earlier prototype?
+ (Fn = CurModule.CurrentModule->getFunction(FunctionName, FT))) {
+ // If this is the case, either we need to be a forward decl, or it needs
+ // to be.
+ if (!CurFun.isDeclare && !Fn->isExternal())
+ ThrowException("Redefinition of function '" + FunctionName + "'!");
+
+ // Make sure to strip off any argument names so we can't get conflicts.
+ if (Fn->isExternal())
+ for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end();
+ AI != AE; ++AI)
+ AI->setName("");
+
+ } else { // Not already defined?
+ Fn = new Function(FT, GlobalValue::ExternalLinkage, FunctionName,
+ CurModule.CurrentModule);
+ InsertValue(Fn, CurModule.Values);
+ }
+
+ CurFun.FunctionStart(Fn);
+ Fn->setCallingConv(yyvsp[-5].UIntVal);
+
+ // Add all of the arguments we parsed to the function...
+ if (yyvsp[-1].ArgList) { // Is null if empty...
+ if (isVarArg) { // Nuke the last entry
+ assert(yyvsp[-1].ArgList->back().first->get() == Type::VoidTy && yyvsp[-1].ArgList->back().second == 0&&
+ "Not a varargs marker!");
+ delete yyvsp[-1].ArgList->back().first;
+ yyvsp[-1].ArgList->pop_back(); // Delete the last entry
+ }
+ Function::arg_iterator ArgIt = Fn->arg_begin();
+ for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = yyvsp[-1].ArgList->begin();
+ I != yyvsp[-1].ArgList->end(); ++I, ++ArgIt) {
+ delete I->first; // Delete the typeholder...
+
+ setValueName(ArgIt, I->second); // Insert arg into symtab...
+ InsertValue(ArgIt);
+ }
+
+ delete yyvsp[-1].ArgList; // We're now done with the argument list
+ }
+;}
+ break;
+
+ case 142:
+#line 1717 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.FunctionVal = CurFun.CurrentFunction;
+
+ // Make sure that we keep track of the linkage type even if there was a
+ // previous "declare".
+ yyval.FunctionVal->setLinkage(yyvsp[-2].Linkage);
+;}
+ break;
+
+ case 145:
+#line 1727 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.FunctionVal = yyvsp[-1].FunctionVal;
+;}
+ break;
+
+ case 146:
+#line 1731 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { CurFun.isDeclare = true; ;}
+ break;
+
+ case 147:
+#line 1731 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.FunctionVal = CurFun.CurrentFunction;
+ CurFun.FunctionDone();
+;}
+ break;
+
+ case 148:
+#line 1740 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // A reference to a direct constant
+ yyval.ValIDVal = ValID::create(yyvsp[0].SInt64Val);
+ ;}
+ break;
+
+ case 149:
+#line 1743 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValIDVal = ValID::create(yyvsp[0].UInt64Val);
+ ;}
+ break;
+
+ case 150:
+#line 1746 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Perhaps it's an FP constant?
+ yyval.ValIDVal = ValID::create(yyvsp[0].FPVal);
+ ;}
+ break;
+
+ case 151:
+#line 1749 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValIDVal = ValID::create(ConstantBool::True);
+ ;}
+ break;
+
+ case 152:
+#line 1752 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValIDVal = ValID::create(ConstantBool::False);
+ ;}
+ break;
+
+ case 153:
+#line 1755 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValIDVal = ValID::createNull();
+ ;}
+ break;
+
+ case 154:
+#line 1758 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValIDVal = ValID::createUndef();
+ ;}
+ break;
+
+ case 155:
+#line 1761 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Nonempty unsized packed vector
+ const Type *ETy = (*yyvsp[-1].ConstVector)[0]->getType();
+ int NumElements = yyvsp[-1].ConstVector->size();
+
+ PackedType* pt = PackedType::get(ETy, NumElements);
+ PATypeHolder* PTy = new PATypeHolder(
+ HandleUpRefs(
+ PackedType::get(
+ ETy,
+ NumElements)
+ )
+ );
+
+ // Verify all elements are correct type!
+ for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) {
+ if (ETy != (*yyvsp[-1].ConstVector)[i]->getType())
+ ThrowException("Element #" + utostr(i) + " is not of type '" +
+ ETy->getDescription() +"' as required!\nIt is of type '" +
+ (*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'.");
+ }
+
+ yyval.ValIDVal = ValID::create(ConstantPacked::get(pt, *yyvsp[-1].ConstVector));
+ delete PTy; delete yyvsp[-1].ConstVector;
+ ;}
+ break;
+
+ case 156:
+#line 1785 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValIDVal = ValID::create(yyvsp[0].ConstVal);
+ ;}
+ break;
+
+ case 157:
+#line 1792 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Is it an integer reference...?
+ yyval.ValIDVal = ValID::create(yyvsp[0].SIntVal);
+ ;}
+ break;
+
+ case 158:
+#line 1795 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Is it a named reference...?
+ yyval.ValIDVal = ValID::create(yyvsp[0].StrVal);
+ ;}
+ break;
+
+ case 161:
+#line 1806 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValueVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal); delete yyvsp[-1].TypeVal;
+ ;}
+ break;
+
+ case 162:
+#line 1810 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.FunctionVal = yyvsp[-1].FunctionVal;
+ ;}
+ break;
+
+ case 163:
+#line 1813 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Do not allow functions with 0 basic blocks
+ yyval.FunctionVal = yyvsp[-1].FunctionVal;
+ ;}
+ break;
+
+ case 164:
+#line 1821 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ setValueName(yyvsp[0].TermInstVal, yyvsp[-1].StrVal);
+ InsertValue(yyvsp[0].TermInstVal);
+
+ yyvsp[-2].BasicBlockVal->getInstList().push_back(yyvsp[0].TermInstVal);
+ InsertValue(yyvsp[-2].BasicBlockVal);
+ yyval.BasicBlockVal = yyvsp[-2].BasicBlockVal;
+ ;}
+ break;
+
+ case 165:
+#line 1830 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyvsp[-1].BasicBlockVal->getInstList().push_back(yyvsp[0].InstVal);
+ yyval.BasicBlockVal = yyvsp[-1].BasicBlockVal;
+ ;}
+ break;
+
+ case 166:
+#line 1834 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BasicBlockVal = CurBB = getBBVal(ValID::create((int)CurFun.NextBBNum++), true);
+
+ // Make sure to move the basic block to the correct location in the
+ // function, instead of leaving it inserted wherever it was first
+ // referenced.
+ Function::BasicBlockListType &BBL =
+ CurFun.CurrentFunction->getBasicBlockList();
+ BBL.splice(BBL.end(), BBL, yyval.BasicBlockVal);
+ ;}
+ break;
+
+ case 167:
+#line 1844 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BasicBlockVal = CurBB = getBBVal(ValID::create(yyvsp[0].StrVal), true);
+
+ // Make sure to move the basic block to the correct location in the
+ // function, instead of leaving it inserted wherever it was first
+ // referenced.
+ Function::BasicBlockListType &BBL =
+ CurFun.CurrentFunction->getBasicBlockList();
+ BBL.splice(BBL.end(), BBL, yyval.BasicBlockVal);
+ ;}
+ break;
+
+ case 168:
+#line 1855 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Return with a result...
+ yyval.TermInstVal = new ReturnInst(yyvsp[0].ValueVal);
+ ;}
+ break;
+
+ case 169:
+#line 1858 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Return with no result...
+ yyval.TermInstVal = new ReturnInst();
+ ;}
+ break;
+
+ case 170:
+#line 1861 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Unconditional Branch...
+ yyval.TermInstVal = new BranchInst(getBBVal(yyvsp[0].ValIDVal));
+ ;}
+ break;
+
+ case 171:
+#line 1864 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TermInstVal = new BranchInst(getBBVal(yyvsp[-3].ValIDVal), getBBVal(yyvsp[0].ValIDVal), getVal(Type::BoolTy, yyvsp[-6].ValIDVal));
+ ;}
+ break;
+
+ case 172:
+#line 1867 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ SwitchInst *S = new SwitchInst(getVal(yyvsp[-7].PrimType, yyvsp[-6].ValIDVal), getBBVal(yyvsp[-3].ValIDVal), yyvsp[-1].JumpTable->size());
+ yyval.TermInstVal = S;
+
+ std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = yyvsp[-1].JumpTable->begin(),
+ E = yyvsp[-1].JumpTable->end();
+ for (; I != E; ++I) {
+ if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
+ S->addCase(CI, I->second);
+ else
+ ThrowException("Switch case is constant, but not a simple integer!");
+ }
+ delete yyvsp[-1].JumpTable;
+ ;}
+ break;
+
+ case 173:
+#line 1881 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ SwitchInst *S = new SwitchInst(getVal(yyvsp[-6].PrimType, yyvsp[-5].ValIDVal), getBBVal(yyvsp[-2].ValIDVal), 0);
+ yyval.TermInstVal = S;
+ ;}
+ break;
+
+ case 174:
+#line 1886 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const PointerType *PFTy;
+ const FunctionType *Ty;
+
+ if (!(PFTy = dyn_cast<PointerType>(yyvsp[-10].TypeVal->get())) ||
+ !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
+ // Pull out the types of all of the arguments...
+ std::vector<const Type*> ParamTypes;
+ if (yyvsp[-7].ValueList) {
+ for (std::vector<Value*>::iterator I = yyvsp[-7].ValueList->begin(), E = yyvsp[-7].ValueList->end();
+ I != E; ++I)
+ ParamTypes.push_back((*I)->getType());
+ }
+
+ bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
+ if (isVarArg) ParamTypes.pop_back();
+
+ Ty = FunctionType::get(yyvsp[-10].TypeVal->get(), ParamTypes, isVarArg);
+ PFTy = PointerType::get(Ty);
+ }
+
+ Value *V = getVal(PFTy, yyvsp[-9].ValIDVal); // Get the function we're calling...
+
+ BasicBlock *Normal = getBBVal(yyvsp[-3].ValIDVal);
+ BasicBlock *Except = getBBVal(yyvsp[0].ValIDVal);
+
+ // Create the call node...
+ if (!yyvsp[-7].ValueList) { // Has no arguments?
+ yyval.TermInstVal = new InvokeInst(V, Normal, Except, std::vector<Value*>());
+ } else { // Has arguments?
+ // Loop through FunctionType's arguments and ensure they are specified
+ // correctly!
+ //
+ FunctionType::param_iterator I = Ty->param_begin();
+ FunctionType::param_iterator E = Ty->param_end();
+ std::vector<Value*>::iterator ArgI = yyvsp[-7].ValueList->begin(), ArgE = yyvsp[-7].ValueList->end();
+
+ for (; ArgI != ArgE && I != E; ++ArgI, ++I)
+ if ((*ArgI)->getType() != *I)
+ ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" +
+ (*I)->getDescription() + "'!");
+
+ if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
+ ThrowException("Invalid number of parameters detected!");
+
+ yyval.TermInstVal = new InvokeInst(V, Normal, Except, *yyvsp[-7].ValueList);
+ }
+ cast<InvokeInst>(yyval.TermInstVal)->setCallingConv(yyvsp[-11].UIntVal);
+
+ delete yyvsp[-10].TypeVal;
+ delete yyvsp[-7].ValueList;
+ ;}
+ break;
+
+ case 175:
+#line 1938 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TermInstVal = new UnwindInst();
+ ;}
+ break;
+
+ case 176:
+#line 1941 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TermInstVal = new UnreachableInst();
+ ;}
+ break;
+
+ case 177:
+#line 1947 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.JumpTable = yyvsp[-5].JumpTable;
+ Constant *V = cast<Constant>(getValNonImprovising(yyvsp[-4].PrimType, yyvsp[-3].ValIDVal));
+ if (V == 0)
+ ThrowException("May only switch on a constant pool value!");
+
+ yyval.JumpTable->push_back(std::make_pair(V, getBBVal(yyvsp[0].ValIDVal)));
+ ;}
+ break;
+
+ case 178:
+#line 1955 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.JumpTable = new std::vector<std::pair<Constant*, BasicBlock*> >();
+ Constant *V = cast<Constant>(getValNonImprovising(yyvsp[-4].PrimType, yyvsp[-3].ValIDVal));
+
+ if (V == 0)
+ ThrowException("May only switch on a constant pool value!");
+
+ yyval.JumpTable->push_back(std::make_pair(V, getBBVal(yyvsp[0].ValIDVal)));
+ ;}
+ break;
+
+ case 179:
+#line 1965 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ // Is this definition named?? if so, assign the name...
+ setValueName(yyvsp[0].InstVal, yyvsp[-1].StrVal);
+ InsertValue(yyvsp[0].InstVal);
+ yyval.InstVal = yyvsp[0].InstVal;
+;}
+ break;
+
+ case 180:
+#line 1972 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Used for PHI nodes
+ yyval.PHIList = new std::list<std::pair<Value*, BasicBlock*> >();
+ yyval.PHIList->push_back(std::make_pair(getVal(*yyvsp[-5].TypeVal, yyvsp[-3].ValIDVal), getBBVal(yyvsp[-1].ValIDVal)));
+ delete yyvsp[-5].TypeVal;
+ ;}
+ break;
+
+ case 181:
+#line 1977 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.PHIList = yyvsp[-6].PHIList;
+ yyvsp[-6].PHIList->push_back(std::make_pair(getVal(yyvsp[-6].PHIList->front().first->getType(), yyvsp[-3].ValIDVal),
+ getBBVal(yyvsp[-1].ValIDVal)));
+ ;}
+ break;
+
+ case 182:
+#line 1984 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Used for call statements, and memory insts...
+ yyval.ValueList = new std::vector<Value*>();
+ yyval.ValueList->push_back(yyvsp[0].ValueVal);
+ ;}
+ break;
+
+ case 183:
+#line 1988 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValueList = yyvsp[-2].ValueList;
+ yyvsp[-2].ValueList->push_back(yyvsp[0].ValueVal);
+ ;}
+ break;
+
+ case 185:
+#line 1994 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.ValueList = 0; ;}
+ break;
+
+ case 186:
+#line 1996 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BoolVal = true;
+ ;}
+ break;
+
+ case 187:
+#line 1999 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BoolVal = false;
+ ;}
+ break;
+
+ case 188:
+#line 2005 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!(*yyvsp[-3].TypeVal)->isInteger() && !(*yyvsp[-3].TypeVal)->isFloatingPoint() &&
+ !isa<PackedType>((*yyvsp[-3].TypeVal).get()))
+ ThrowException(
+ "Arithmetic operator requires integer, FP, or packed operands!");
+ if (isa<PackedType>((*yyvsp[-3].TypeVal).get()) && yyvsp[-4].BinaryOpVal == Instruction::Rem)
+ ThrowException("Rem not supported on packed types!");
+ yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal, getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal), getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal));
+ if (yyval.InstVal == 0)
+ ThrowException("binary operator returned null!");
+ delete yyvsp[-3].TypeVal;
+ ;}
+ break;
+
+ case 189:
+#line 2017 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!(*yyvsp[-3].TypeVal)->isIntegral())
+ ThrowException("Logical operator requires integral operands!");
+ yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal, getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal), getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal));
+ if (yyval.InstVal == 0)
+ ThrowException("binary operator returned null!");
+ delete yyvsp[-3].TypeVal;
+ ;}
+ break;
+
+ case 190:
+#line 2025 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if(isa<PackedType>((*yyvsp[-3].TypeVal).get())) {
+ ThrowException(
+ "PackedTypes currently not supported in setcc instructions!");
+ }
+ yyval.InstVal = new SetCondInst(yyvsp[-4].BinaryOpVal, getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal), getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal));
+ if (yyval.InstVal == 0)
+ ThrowException("binary operator returned null!");
+ delete yyvsp[-3].TypeVal;
+ ;}
+ break;
+
+ case 191:
+#line 2035 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ std::cerr << "WARNING: Use of eliminated 'not' instruction:"
+ << " Replacing with 'xor'.\n";
+
+ Value *Ones = ConstantIntegral::getAllOnesValue(yyvsp[0].ValueVal->getType());
+ if (Ones == 0)
+ ThrowException("Expected integral type for not instruction!");
+
+ yyval.InstVal = BinaryOperator::create(Instruction::Xor, yyvsp[0].ValueVal, Ones);
+ if (yyval.InstVal == 0)
+ ThrowException("Could not create a xor instruction!");
+ ;}
+ break;
+
+ case 192:
+#line 2047 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[0].ValueVal->getType() != Type::UByteTy)
+ ThrowException("Shift amount must be ubyte!");
+ if (!yyvsp[-2].ValueVal->getType()->isInteger())
+ ThrowException("Shift constant expression requires integer operand!");
+ yyval.InstVal = new ShiftInst(yyvsp[-3].OtherOpVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
+ ;}
+ break;
+
+ case 193:
+#line 2054 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!yyvsp[0].TypeVal->get()->isFirstClassType())
+ ThrowException("cast instruction to a non-primitive type: '" +
+ yyvsp[0].TypeVal->get()->getDescription() + "'!");
+ yyval.InstVal = new CastInst(yyvsp[-2].ValueVal, *yyvsp[0].TypeVal);
+ delete yyvsp[0].TypeVal;
+ ;}
+ break;
+
+ case 194:
+#line 2061 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-4].ValueVal->getType() != Type::BoolTy)
+ ThrowException("select condition must be boolean!");
+ if (yyvsp[-2].ValueVal->getType() != yyvsp[0].ValueVal->getType())
+ ThrowException("select value types should match!");
+ yyval.InstVal = new SelectInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
+ ;}
+ break;
+
+ case 195:
+#line 2068 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ NewVarArgs = true;
+ yyval.InstVal = new VAArgInst(yyvsp[-2].ValueVal, *yyvsp[0].TypeVal);
+ delete yyvsp[0].TypeVal;
+ ;}
+ break;
+
+ case 196:
+#line 2073 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ ObsoleteVarArgs = true;
+ const Type* ArgTy = yyvsp[-2].ValueVal->getType();
+ Function* NF = CurModule.CurrentModule->
+ getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, 0);
+
+ //b = vaarg a, t ->
+ //foo = alloca 1 of t
+ //bar = vacopy a
+ //store bar -> foo
+ //b = vaarg foo, t
+ AllocaInst* foo = new AllocaInst(ArgTy, 0, "vaarg.fix");
+ CurBB->getInstList().push_back(foo);
+ CallInst* bar = new CallInst(NF, yyvsp[-2].ValueVal);
+ CurBB->getInstList().push_back(bar);
+ CurBB->getInstList().push_back(new StoreInst(bar, foo));
+ yyval.InstVal = new VAArgInst(foo, *yyvsp[0].TypeVal);
+ delete yyvsp[0].TypeVal;
+ ;}
+ break;
+
+ case 197:
+#line 2092 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ ObsoleteVarArgs = true;
+ const Type* ArgTy = yyvsp[-2].ValueVal->getType();
+ Function* NF = CurModule.CurrentModule->
+ getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, 0);
+
+ //b = vanext a, t ->
+ //foo = alloca 1 of t
+ //bar = vacopy a
+ //store bar -> foo
+ //tmp = vaarg foo, t
+ //b = load foo
+ AllocaInst* foo = new AllocaInst(ArgTy, 0, "vanext.fix");
+ CurBB->getInstList().push_back(foo);
+ CallInst* bar = new CallInst(NF, yyvsp[-2].ValueVal);
+ CurBB->getInstList().push_back(bar);
+ CurBB->getInstList().push_back(new StoreInst(bar, foo));
+ Instruction* tmp = new VAArgInst(foo, *yyvsp[0].TypeVal);
+ CurBB->getInstList().push_back(tmp);
+ yyval.InstVal = new LoadInst(foo);
+ delete yyvsp[0].TypeVal;
+ ;}
+ break;
+
+ case 198:
+#line 2114 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const Type *Ty = yyvsp[0].PHIList->front().first->getType();
+ if (!Ty->isFirstClassType())
+ ThrowException("PHI node operands must be of first class type!");
+ yyval.InstVal = new PHINode(Ty);
+ ((PHINode*)yyval.InstVal)->reserveOperandSpace(yyvsp[0].PHIList->size());
+ while (yyvsp[0].PHIList->begin() != yyvsp[0].PHIList->end()) {
+ if (yyvsp[0].PHIList->front().first->getType() != Ty)
+ ThrowException("All elements of a PHI node must be of the same type!");
+ cast<PHINode>(yyval.InstVal)->addIncoming(yyvsp[0].PHIList->front().first, yyvsp[0].PHIList->front().second);
+ yyvsp[0].PHIList->pop_front();
+ }
+ delete yyvsp[0].PHIList; // Free the list...
+ ;}
+ break;
+
+ case 199:
+#line 2128 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const PointerType *PFTy;
+ const FunctionType *Ty;
+
+ if (!(PFTy = dyn_cast<PointerType>(yyvsp[-4].TypeVal->get())) ||
+ !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
+ // Pull out the types of all of the arguments...
+ std::vector<const Type*> ParamTypes;
+ if (yyvsp[-1].ValueList) {
+ for (std::vector<Value*>::iterator I = yyvsp[-1].ValueList->begin(), E = yyvsp[-1].ValueList->end();
+ I != E; ++I)
+ ParamTypes.push_back((*I)->getType());
+ }
+
+ bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
+ if (isVarArg) ParamTypes.pop_back();
+
+ if (!(*yyvsp[-4].TypeVal)->isFirstClassType() && *yyvsp[-4].TypeVal != Type::VoidTy)
+ ThrowException("LLVM functions cannot return aggregate types!");
+
+ Ty = FunctionType::get(yyvsp[-4].TypeVal->get(), ParamTypes, isVarArg);
+ PFTy = PointerType::get(Ty);
+ }
+
+ Value *V = getVal(PFTy, yyvsp[-3].ValIDVal); // Get the function we're calling...
+
+ // Create the call node...
+ if (!yyvsp[-1].ValueList) { // Has no arguments?
+ // Make sure no arguments is a good thing!
+ if (Ty->getNumParams() != 0)
+ ThrowException("No arguments passed to a function that "
+ "expects arguments!");
+
+ yyval.InstVal = new CallInst(V, std::vector<Value*>());
+ } else { // Has arguments?
+ // Loop through FunctionType's arguments and ensure they are specified
+ // correctly!
+ //
+ FunctionType::param_iterator I = Ty->param_begin();
+ FunctionType::param_iterator E = Ty->param_end();
+ std::vector<Value*>::iterator ArgI = yyvsp[-1].ValueList->begin(), ArgE = yyvsp[-1].ValueList->end();
+
+ for (; ArgI != ArgE && I != E; ++ArgI, ++I)
+ if ((*ArgI)->getType() != *I)
+ ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" +
+ (*I)->getDescription() + "'!");
+
+ if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
+ ThrowException("Invalid number of parameters detected!");
+
+ yyval.InstVal = new CallInst(V, *yyvsp[-1].ValueList);
+ }
+ cast<CallInst>(yyval.InstVal)->setTailCall(yyvsp[-6].BoolVal);
+ cast<CallInst>(yyval.InstVal)->setCallingConv(yyvsp[-5].UIntVal);
+ delete yyvsp[-4].TypeVal;
+ delete yyvsp[-1].ValueList;
+ ;}
+ break;
+
+ case 200:
+#line 2185 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.InstVal = yyvsp[0].InstVal;
+ ;}
+ break;
+
+ case 201:
+#line 2191 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValueList = yyvsp[0].ValueList;
+ ;}
+ break;
+
+ case 202:
+#line 2193 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValueList = new std::vector<Value*>();
+ ;}
+ break;
+
+ case 203:
+#line 2197 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BoolVal = true;
+ ;}
+ break;
+
+ case 204:
+#line 2200 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BoolVal = false;
+ ;}
+ break;
+
+ case 205:
+#line 2206 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.InstVal = new MallocInst(*yyvsp[0].TypeVal);
+ delete yyvsp[0].TypeVal;
+ ;}
+ break;
+
+ case 206:
+#line 2210 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.InstVal = new MallocInst(*yyvsp[-3].TypeVal, getVal(yyvsp[-1].PrimType, yyvsp[0].ValIDVal));
+ delete yyvsp[-3].TypeVal;
+ ;}
+ break;
+
+ case 207:
+#line 2214 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.InstVal = new AllocaInst(*yyvsp[0].TypeVal);
+ delete yyvsp[0].TypeVal;
+ ;}
+ break;
+
+ case 208:
+#line 2218 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.InstVal = new AllocaInst(*yyvsp[-3].TypeVal, getVal(yyvsp[-1].PrimType, yyvsp[0].ValIDVal));
+ delete yyvsp[-3].TypeVal;
+ ;}
+ break;
+
+ case 209:
+#line 2222 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!isa<PointerType>(yyvsp[0].ValueVal->getType()))
+ ThrowException("Trying to free nonpointer type " +
+ yyvsp[0].ValueVal->getType()->getDescription() + "!");
+ yyval.InstVal = new FreeInst(yyvsp[0].ValueVal);
+ ;}
+ break;
+
+ case 210:
+#line 2229 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!isa<PointerType>(yyvsp[-1].TypeVal->get()))
+ ThrowException("Can't load from nonpointer type: " +
+ (*yyvsp[-1].TypeVal)->getDescription());
+ if (!cast<PointerType>(yyvsp[-1].TypeVal->get())->getElementType()->isFirstClassType())
+ ThrowException("Can't load from pointer of non-first-class type: " +
+ (*yyvsp[-1].TypeVal)->getDescription());
+ yyval.InstVal = new LoadInst(getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal), "", yyvsp[-3].BoolVal);
+ delete yyvsp[-1].TypeVal;
+ ;}
+ break;
+
+ case 211:
+#line 2239 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const PointerType *PT = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
+ if (!PT)
+ ThrowException("Can't store to a nonpointer type: " +
+ (*yyvsp[-1].TypeVal)->getDescription());
+ const Type *ElTy = PT->getElementType();
+ if (ElTy != yyvsp[-3].ValueVal->getType())
+ ThrowException("Can't store '" + yyvsp[-3].ValueVal->getType()->getDescription() +
+ "' into space of type '" + ElTy->getDescription() + "'!");
+
+ yyval.InstVal = new StoreInst(yyvsp[-3].ValueVal, getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal), yyvsp[-5].BoolVal);
+ delete yyvsp[-1].TypeVal;
+ ;}
+ break;
+
+ case 212:
+#line 2252 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!isa<PointerType>(yyvsp[-2].TypeVal->get()))
+ ThrowException("getelementptr insn requires pointer operand!");
+
+ // LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte struct
+ // indices to uint struct indices for compatibility.
+ generic_gep_type_iterator<std::vector<Value*>::iterator>
+ GTI = gep_type_begin(yyvsp[-2].TypeVal->get(), yyvsp[0].ValueList->begin(), yyvsp[0].ValueList->end()),
+ GTE = gep_type_end(yyvsp[-2].TypeVal->get(), yyvsp[0].ValueList->begin(), yyvsp[0].ValueList->end());
+ for (unsigned i = 0, e = yyvsp[0].ValueList->size(); i != e && GTI != GTE; ++i, ++GTI)
+ if (isa<StructType>(*GTI)) // Only change struct indices
+ if (ConstantUInt *CUI = dyn_cast<ConstantUInt>((*yyvsp[0].ValueList)[i]))
+ if (CUI->getType() == Type::UByteTy)
+ (*yyvsp[0].ValueList)[i] = ConstantExpr::getCast(CUI, Type::UIntTy);
+
+ if (!GetElementPtrInst::getIndexedType(*yyvsp[-2].TypeVal, *yyvsp[0].ValueList, true))
+ ThrowException("Invalid getelementptr indices for type '" +
+ (*yyvsp[-2].TypeVal)->getDescription()+ "'!");
+ yyval.InstVal = new GetElementPtrInst(getVal(*yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal), *yyvsp[0].ValueList);
+ delete yyvsp[-2].TypeVal; delete yyvsp[0].ValueList;
+ ;}
+ break;
+
+
+ }
+
+/* Line 1000 of yacc.c. */
+#line 4352 "llvmAsmParser.tab.c"
+
+ yyvsp -= yylen;
+ yyssp -= yylen;
+
+
+ YY_STACK_PRINT (yyss, yyssp);
+
+ *++yyvsp = yyval;
+
+
+ /* Now `shift' the result of the reduction. Determine what state
+ that goes to, based on the state we popped back to and the rule
+ number reduced by. */
+
+ yyn = yyr1[yyn];
+
+ yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
+ if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+ yystate = yytable[yystate];
+ else
+ yystate = yydefgoto[yyn - YYNTOKENS];
+
+ goto yynewstate;
+
+
+/*------------------------------------.
+| yyerrlab -- here on detecting error |
+`------------------------------------*/
+yyerrlab:
+ /* If not already recovering from an error, report this error. */
+ if (!yyerrstatus)
+ {
+ ++yynerrs;
+#if YYERROR_VERBOSE
+ yyn = yypact[yystate];
+
+ if (YYPACT_NINF < yyn && yyn < YYLAST)
+ {
+ YYSIZE_T yysize = 0;
+ int yytype = YYTRANSLATE (yychar);
+ const char* yyprefix;
+ char *yymsg;
+ int yyx;
+
+ /* Start YYX at -YYN if negative to avoid negative indexes in
+ YYCHECK. */
+ int yyxbegin = yyn < 0 ? -yyn : 0;
+
+ /* Stay within bounds of both yycheck and yytname. */
+ int yychecklim = YYLAST - yyn;
+ int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
+ int yycount = 0;
+
+ yyprefix = ", expecting ";
+ for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+ if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
+ {
+ yysize += yystrlen (yyprefix) + yystrlen (yytname [yyx]);
+ yycount += 1;
+ if (yycount == 5)
+ {
+ yysize = 0;
+ break;
+ }
+ }
+ yysize += (sizeof ("syntax error, unexpected ")
+ + yystrlen (yytname[yytype]));
+ yymsg = (char *) YYSTACK_ALLOC (yysize);
+ if (yymsg != 0)
+ {
+ char *yyp = yystpcpy (yymsg, "syntax error, unexpected ");
+ yyp = yystpcpy (yyp, yytname[yytype]);
+
+ if (yycount < 5)
+ {
+ yyprefix = ", expecting ";
+ for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+ if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
+ {
+ yyp = yystpcpy (yyp, yyprefix);
+ yyp = yystpcpy (yyp, yytname[yyx]);
+ yyprefix = " or ";
+ }
+ }
+ yyerror (yymsg);
+ YYSTACK_FREE (yymsg);
+ }
+ else
+ yyerror ("syntax error; also virtual memory exhausted");
+ }
+ else
+#endif /* YYERROR_VERBOSE */
+ yyerror ("syntax error");
+ }
+
+
+
+ if (yyerrstatus == 3)
+ {
+ /* If just tried and failed to reuse lookahead token after an
+ error, discard it. */
+
+ if (yychar <= YYEOF)
+ {
+ /* If at end of input, pop the error token,
+ then the rest of the stack, then return failure. */
+ if (yychar == YYEOF)
+ for (;;)
+ {
+ YYPOPSTACK;
+ if (yyssp == yyss)
+ YYABORT;
+ YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp);
+ yydestruct (yystos[*yyssp], yyvsp);
+ }
+ }
+ else
+ {
+ YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc);
+ yydestruct (yytoken, &yylval);
+ yychar = YYEMPTY;
+
+ }
+ }
+
+ /* Else will try to reuse lookahead token after shifting the error
+ token. */
+ goto yyerrlab1;
+
+
+/*---------------------------------------------------.
+| yyerrorlab -- error raised explicitly by YYERROR. |
+`---------------------------------------------------*/
+yyerrorlab:
+
+#ifdef __GNUC__
+ /* Pacify GCC when the user code never invokes YYERROR and the label
+ yyerrorlab therefore never appears in user code. */
+ if (0)
+ goto yyerrorlab;
+#endif
+
+ yyvsp -= yylen;
+ yyssp -= yylen;
+ yystate = *yyssp;
+ goto yyerrlab1;
+
+
+/*-------------------------------------------------------------.
+| yyerrlab1 -- common code for both syntax error and YYERROR. |
+`-------------------------------------------------------------*/
+yyerrlab1:
+ yyerrstatus = 3; /* Each real token shifted decrements this. */
+
+ for (;;)
+ {
+ yyn = yypact[yystate];
+ if (yyn != YYPACT_NINF)
+ {
+ yyn += YYTERROR;
+ if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
+ {
+ yyn = yytable[yyn];
+ if (0 < yyn)
+ break;
+ }
+ }
+
+ /* Pop the current state because it cannot handle the error token. */
+ if (yyssp == yyss)
+ YYABORT;
+
+ YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp);
+ yydestruct (yystos[yystate], yyvsp);
+ YYPOPSTACK;
+ yystate = *yyssp;
+ YY_STACK_PRINT (yyss, yyssp);
+ }
+
+ if (yyn == YYFINAL)
+ YYACCEPT;
+
+ YYDPRINTF ((stderr, "Shifting error token, "));
+
+ *++yyvsp = yylval;
+
+
+ yystate = yyn;
+ goto yynewstate;
+
+
+/*-------------------------------------.
+| yyacceptlab -- YYACCEPT comes here. |
+`-------------------------------------*/
+yyacceptlab:
+ yyresult = 0;
+ goto yyreturn;
+
+/*-----------------------------------.
+| yyabortlab -- YYABORT comes here. |
+`-----------------------------------*/
+yyabortlab:
+ yyresult = 1;
+ goto yyreturn;
+
+#ifndef yyoverflow
+/*----------------------------------------------.
+| yyoverflowlab -- parser overflow comes here. |
+`----------------------------------------------*/
+yyoverflowlab:
+ yyerror ("parser stack overflow");
+ yyresult = 2;
+ /* Fall through. */
+#endif
+
+yyreturn:
+#ifndef yyoverflow
+ if (yyss != yyssa)
+ YYSTACK_FREE (yyss);
+#endif
+ return yyresult;
+}
+
+
+#line 2275 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+
+int yyerror(const char *ErrorMsg) {
+ std::string where
+ = std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename)
+ + ":" + utostr((unsigned) llvmAsmlineno) + ": ";
+ std::string errMsg = std::string(ErrorMsg) + "\n" + where + " while reading ";
+ if (yychar == YYEMPTY || yychar == 0)
+ errMsg += "end-of-file.";
+ else
+ errMsg += "token: '" + std::string(llvmAsmtext, llvmAsmleng) + "'";
+ ThrowException(errMsg);
+ return 0;
+}
+
Index: llvm/lib/AsmParser/llvmAsmParser.h
diff -u /dev/null llvm/lib/AsmParser/llvmAsmParser.h:1.9
--- /dev/null Sat Aug 27 13:50:52 2005
+++ llvm/lib/AsmParser/llvmAsmParser.h Sat Aug 27 13:50:38 2005
@@ -0,0 +1,271 @@
+/* A Bison parser, made by GNU Bison 1.875c. */
+
+/* Skeleton parser for Yacc-like parsing with Bison,
+ Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
+
+ This program is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2, or (at your option)
+ any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 59 Temple Place - Suite 330,
+ Boston, MA 02111-1307, USA. */
+
+/* As a special exception, when this file is copied by Bison into a
+ Bison output file, you may use that output file without restriction.
+ This special exception was added by the Free Software Foundation
+ in version 1.24 of Bison. */
+
+/* Tokens. */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+ /* Put the tokens into the symbol table, so that GDB and other debuggers
+ know about them. */
+ enum yytokentype {
+ ESINT64VAL = 258,
+ EUINT64VAL = 259,
+ SINTVAL = 260,
+ UINTVAL = 261,
+ FPVAL = 262,
+ VOID = 263,
+ BOOL = 264,
+ SBYTE = 265,
+ UBYTE = 266,
+ SHORT = 267,
+ USHORT = 268,
+ INT = 269,
+ UINT = 270,
+ LONG = 271,
+ ULONG = 272,
+ FLOAT = 273,
+ DOUBLE = 274,
+ TYPE = 275,
+ LABEL = 276,
+ VAR_ID = 277,
+ LABELSTR = 278,
+ STRINGCONSTANT = 279,
+ IMPLEMENTATION = 280,
+ ZEROINITIALIZER = 281,
+ TRUETOK = 282,
+ FALSETOK = 283,
+ BEGINTOK = 284,
+ ENDTOK = 285,
+ DECLARE = 286,
+ GLOBAL = 287,
+ CONSTANT = 288,
+ VOLATILE = 289,
+ TO = 290,
+ DOTDOTDOT = 291,
+ NULL_TOK = 292,
+ UNDEF = 293,
+ CONST = 294,
+ INTERNAL = 295,
+ LINKONCE = 296,
+ WEAK = 297,
+ APPENDING = 298,
+ OPAQUE = 299,
+ NOT = 300,
+ EXTERNAL = 301,
+ TARGET = 302,
+ TRIPLE = 303,
+ ENDIAN = 304,
+ POINTERSIZE = 305,
+ LITTLE = 306,
+ BIG = 307,
+ DEPLIBS = 308,
+ CALL = 309,
+ TAIL = 310,
+ CC_TOK = 311,
+ CCC_TOK = 312,
+ FASTCC_TOK = 313,
+ COLDCC_TOK = 314,
+ RET = 315,
+ BR = 316,
+ SWITCH = 317,
+ INVOKE = 318,
+ UNWIND = 319,
+ UNREACHABLE = 320,
+ ADD = 321,
+ SUB = 322,
+ MUL = 323,
+ DIV = 324,
+ REM = 325,
+ AND = 326,
+ OR = 327,
+ XOR = 328,
+ SETLE = 329,
+ SETGE = 330,
+ SETLT = 331,
+ SETGT = 332,
+ SETEQ = 333,
+ SETNE = 334,
+ MALLOC = 335,
+ ALLOCA = 336,
+ FREE = 337,
+ LOAD = 338,
+ STORE = 339,
+ GETELEMENTPTR = 340,
+ PHI_TOK = 341,
+ CAST = 342,
+ SELECT = 343,
+ SHL = 344,
+ SHR = 345,
+ VAARG = 346,
+ VAARG_old = 347,
+ VANEXT_old = 348
+ };
+#endif
+#define ESINT64VAL 258
+#define EUINT64VAL 259
+#define SINTVAL 260
+#define UINTVAL 261
+#define FPVAL 262
+#define VOID 263
+#define BOOL 264
+#define SBYTE 265
+#define UBYTE 266
+#define SHORT 267
+#define USHORT 268
+#define INT 269
+#define UINT 270
+#define LONG 271
+#define ULONG 272
+#define FLOAT 273
+#define DOUBLE 274
+#define TYPE 275
+#define LABEL 276
+#define VAR_ID 277
+#define LABELSTR 278
+#define STRINGCONSTANT 279
+#define IMPLEMENTATION 280
+#define ZEROINITIALIZER 281
+#define TRUETOK 282
+#define FALSETOK 283
+#define BEGINTOK 284
+#define ENDTOK 285
+#define DECLARE 286
+#define GLOBAL 287
+#define CONSTANT 288
+#define VOLATILE 289
+#define TO 290
+#define DOTDOTDOT 291
+#define NULL_TOK 292
+#define UNDEF 293
+#define CONST 294
+#define INTERNAL 295
+#define LINKONCE 296
+#define WEAK 297
+#define APPENDING 298
+#define OPAQUE 299
+#define NOT 300
+#define EXTERNAL 301
+#define TARGET 302
+#define TRIPLE 303
+#define ENDIAN 304
+#define POINTERSIZE 305
+#define LITTLE 306
+#define BIG 307
+#define DEPLIBS 308
+#define CALL 309
+#define TAIL 310
+#define CC_TOK 311
+#define CCC_TOK 312
+#define FASTCC_TOK 313
+#define COLDCC_TOK 314
+#define RET 315
+#define BR 316
+#define SWITCH 317
+#define INVOKE 318
+#define UNWIND 319
+#define UNREACHABLE 320
+#define ADD 321
+#define SUB 322
+#define MUL 323
+#define DIV 324
+#define REM 325
+#define AND 326
+#define OR 327
+#define XOR 328
+#define SETLE 329
+#define SETGE 330
+#define SETLT 331
+#define SETGT 332
+#define SETEQ 333
+#define SETNE 334
+#define MALLOC 335
+#define ALLOCA 336
+#define FREE 337
+#define LOAD 338
+#define STORE 339
+#define GETELEMENTPTR 340
+#define PHI_TOK 341
+#define CAST 342
+#define SELECT 343
+#define SHL 344
+#define SHR 345
+#define VAARG 346
+#define VAARG_old 347
+#define VANEXT_old 348
+
+
+
+
+#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED)
+#line 865 "/proj/llvm/build/../llvm/lib/AsmParser/llvmAsmParser.y"
+typedef union YYSTYPE {
+ llvm::Module *ModuleVal;
+ llvm::Function *FunctionVal;
+ std::pair<llvm::PATypeHolder*, char*> *ArgVal;
+ llvm::BasicBlock *BasicBlockVal;
+ llvm::TerminatorInst *TermInstVal;
+ llvm::Instruction *InstVal;
+ llvm::Constant *ConstVal;
+
+ const llvm::Type *PrimType;
+ llvm::PATypeHolder *TypeVal;
+ llvm::Value *ValueVal;
+
+ std::vector<std::pair<llvm::PATypeHolder*,char*> > *ArgList;
+ std::vector<llvm::Value*> *ValueList;
+ std::list<llvm::PATypeHolder> *TypeList;
+ // Represent the RHS of PHI node
+ std::list<std::pair<llvm::Value*,
+ llvm::BasicBlock*> > *PHIList;
+ std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
+ std::vector<llvm::Constant*> *ConstVector;
+
+ llvm::GlobalValue::LinkageTypes Linkage;
+ int64_t SInt64Val;
+ uint64_t UInt64Val;
+ int SIntVal;
+ unsigned UIntVal;
+ double FPVal;
+ bool BoolVal;
+
+ char *StrVal; // This memory is strdup'd!
+ llvm::ValID ValIDVal; // strdup'd memory maybe!
+
+ llvm::Instruction::BinaryOps BinaryOpVal;
+ llvm::Instruction::TermOps TermOpVal;
+ llvm::Instruction::MemoryOps MemOpVal;
+ llvm::Instruction::OtherOps OtherOpVal;
+ llvm::Module::Endianness Endianness;
+} YYSTYPE;
+/* Line 1275 of yacc.c. */
+#line 263 "llvmAsmParser.tab.h"
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+# define YYSTYPE_IS_TRIVIAL 1
+#endif
+
+extern YYSTYPE llvmAsmlval;
+
+
+
Index: llvm/lib/AsmParser/.cvsignore
diff -u llvm/lib/AsmParser/.cvsignore:1.2 llvm/lib/AsmParser/.cvsignore:1.3
--- llvm/lib/AsmParser/.cvsignore:1.2 Tue Apr 19 10:27:29 2005
+++ llvm/lib/AsmParser/.cvsignore Sat Aug 27 13:50:38 2005
@@ -1,4 +1 @@
-Lexer.cpp
-llvmAsmParser.cpp
-llvmAsmParser.h
llvmAsmParser.output
Index: llvm/lib/AsmParser/Makefile
diff -u llvm/lib/AsmParser/Makefile:1.7 llvm/lib/AsmParser/Makefile:1.8
--- llvm/lib/AsmParser/Makefile:1.7 Mon Jan 31 19:47:12 2005
+++ llvm/lib/AsmParser/Makefile Sat Aug 27 13:50:38 2005
@@ -9,7 +9,6 @@
LEVEL = ../..
LIBRARYNAME := LLVMAsmParser
-BUILT_SOURCES := llvmAsmParser.cpp llvmAsmParser.h Lexer.cpp
include $(LEVEL)/Makefile.common
@@ -17,4 +16,4 @@
# Make the object code file for the lexer depend upon the header file generated
# by the Bison parser. This prevents the Lexer from being compiled before the
# header file it needs is built.
-$(OBJDIR)/Lexer.o: llvmAsmParser.h
+$(ObjDir)/Lexer.o: $(PROJ_SRC_DIR)/llvmAsmParser.h
More information about the llvm-commits
mailing list