diff options
| author | Tanya Lattner <tonic@nondot.org> | 2006-11-08 17:51:54 +0000 |
|---|---|---|
| committer | Tanya Lattner <tonic@nondot.org> | 2006-11-08 17:51:54 +0000 |
| commit | 348cda6881284df6c788c30084d7b03b8342b791 (patch) | |
| tree | 5106f2dac35c519ec40d44afa93db5be75961cdc | |
| parent | 532aeb4d55797ea8fe12a659decd078de10a27fb (diff) | |
| download | llvm-348cda6881284df6c788c30084d7b03b8342b791.zip llvm-348cda6881284df6c788c30084d7b03b8342b791.tar.gz llvm-348cda6881284df6c788c30084d7b03b8342b791.tar.bz2 | |
Merging from mainline and fixing wrong merge of llvmAsmParser.y
llvm-svn: 31557
| -rw-r--r-- | llvm/lib/AsmParser/Lexer.cpp.cvs | 281 | ||||
| -rw-r--r-- | llvm/lib/AsmParser/llvmAsmParser.cpp.cvs | 6420 | ||||
| -rw-r--r-- | llvm/lib/AsmParser/llvmAsmParser.y | 3099 | ||||
| -rw-r--r-- | llvm/lib/AsmParser/llvmAsmParser.y.cvs | 4 |
4 files changed, 5224 insertions, 4580 deletions
diff --git a/llvm/lib/AsmParser/Lexer.cpp.cvs b/llvm/lib/AsmParser/Lexer.cpp.cvs index d11bfa0..9d6db66 100644 --- a/llvm/lib/AsmParser/Lexer.cpp.cvs +++ b/llvm/lib/AsmParser/Lexer.cpp.cvs @@ -17,7 +17,7 @@ #define yylineno llvmAsmlineno #line 20 "Lexer.cpp" -/* A lexical scanner generated by flex*/ +/* A lexical scanner generated by flex */ /* Scanner skeleton version: * $Header$ @@ -28,7 +28,6 @@ #define YY_FLEX_MINOR_VERSION 5 #include <stdio.h> -#include <unistd.h> /* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */ @@ -42,6 +41,7 @@ #ifdef __cplusplus #include <stdlib.h> +#include <unistd.h> /* Use prototypes in function declarations. */ #define YY_USE_PROTOS @@ -153,15 +153,6 @@ extern FILE *yyin, *yyout; #define unput(c) yyunput( c, yytext_ptr ) -/* Some routines like yy_flex_realloc() are emitted as static but are - not called by all lexers. This generates warnings in some compilers, - notably GCC. Arrange to suppress these. */ -#ifdef __GNUC__ -#define YY_MAY_BE_UNUSED __attribute__((unused)) -#else -#define YY_MAY_BE_UNUSED -#endif - /* 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). @@ -268,7 +259,7 @@ 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 )) YY_MAY_BE_UNUSED; +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 @@ -854,7 +845,7 @@ goto find_rule; \ #define YY_MORE_ADJ 0 #define YY_RESTORE_YY_MORE_OFFSET char *yytext; -#line 1 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 1 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" #define INITIAL 0 /*===-- Lexer.l - Scanner for llvm assembly files --------------*- C++ -*--===// // @@ -869,7 +860,7 @@ char *yytext; // //===----------------------------------------------------------------------===*/ #define YY_NEVER_INTERACTIVE 1 -#line 28 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 28 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" #include "ParserInternals.h" #include "llvm/Module.h" #include <list> @@ -1005,7 +996,7 @@ using namespace llvm; /* HexIntConstant - Hexadecimal constant generated by the CFE to avoid forcing * it to deal with 64 bit numbers. */ -#line 1009 "Lexer.cpp" +#line 1000 "Lexer.cpp" /* Macros after this point can all be overridden by user definitions in * section 1. @@ -1153,13 +1144,13 @@ YY_MALLOC_DECL YY_DECL { register yy_state_type yy_current_state; - register char *yy_cp = NULL, *yy_bp = NULL; + register char *yy_cp, *yy_bp; register int yy_act; -#line 189 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 189 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" -#line 1163 "Lexer.cpp" +#line 1154 "Lexer.cpp" if ( yy_init ) { @@ -1252,537 +1243,537 @@ do_action: /* This label is used only to access EOF actions. */ { /* beginning of action switch */ case 1: YY_RULE_SETUP -#line 191 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 191 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { /* Ignore comments for now */ } YY_BREAK case 2: YY_RULE_SETUP -#line 193 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 193 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return BEGINTOK; } YY_BREAK case 3: YY_RULE_SETUP -#line 194 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 194 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return ENDTOK; } YY_BREAK case 4: YY_RULE_SETUP -#line 195 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 195 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return TRUETOK; } YY_BREAK case 5: YY_RULE_SETUP -#line 196 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 196 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return FALSETOK; } YY_BREAK case 6: YY_RULE_SETUP -#line 197 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 197 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return DECLARE; } YY_BREAK case 7: YY_RULE_SETUP -#line 198 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 198 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return GLOBAL; } YY_BREAK case 8: YY_RULE_SETUP -#line 199 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 199 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return CONSTANT; } YY_BREAK case 9: YY_RULE_SETUP -#line 200 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 200 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return INTERNAL; } YY_BREAK case 10: YY_RULE_SETUP -#line 201 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 201 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return LINKONCE; } YY_BREAK case 11: YY_RULE_SETUP -#line 202 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 202 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return WEAK; } YY_BREAK case 12: YY_RULE_SETUP -#line 203 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 203 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return APPENDING; } YY_BREAK case 13: YY_RULE_SETUP -#line 204 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 204 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return DLLIMPORT; } YY_BREAK case 14: YY_RULE_SETUP -#line 205 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 205 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return DLLEXPORT; } YY_BREAK case 15: YY_RULE_SETUP -#line 206 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 206 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return EXTERN_WEAK; } YY_BREAK case 16: YY_RULE_SETUP -#line 207 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 207 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return EXTERNAL; } /* Deprecated, turn into external */ YY_BREAK case 17: YY_RULE_SETUP -#line 208 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 208 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return EXTERNAL; } YY_BREAK case 18: YY_RULE_SETUP -#line 209 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 209 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return IMPLEMENTATION; } YY_BREAK case 19: YY_RULE_SETUP -#line 210 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 210 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return ZEROINITIALIZER; } YY_BREAK case 20: YY_RULE_SETUP -#line 211 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 211 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return DOTDOTDOT; } YY_BREAK case 21: YY_RULE_SETUP -#line 212 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 212 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return UNDEF; } YY_BREAK case 22: YY_RULE_SETUP -#line 213 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 213 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return NULL_TOK; } YY_BREAK case 23: YY_RULE_SETUP -#line 214 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 214 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return TO; } YY_BREAK case 24: YY_RULE_SETUP -#line 215 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 215 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(TermOpVal, Unwind, UNWIND); } YY_BREAK case 25: YY_RULE_SETUP -#line 216 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 216 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return NOT; } /* Deprecated, turned into XOR */ YY_BREAK case 26: YY_RULE_SETUP -#line 217 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 217 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return TAIL; } YY_BREAK case 27: YY_RULE_SETUP -#line 218 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 218 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return TARGET; } YY_BREAK case 28: YY_RULE_SETUP -#line 219 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 219 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return TRIPLE; } YY_BREAK case 29: YY_RULE_SETUP -#line 220 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 220 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return DEPLIBS; } YY_BREAK case 30: YY_RULE_SETUP -#line 221 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 221 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return ENDIAN; } YY_BREAK case 31: YY_RULE_SETUP -#line 222 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 222 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return POINTERSIZE; } YY_BREAK case 32: YY_RULE_SETUP -#line 223 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 223 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return DATALAYOUT; } YY_BREAK case 33: YY_RULE_SETUP -#line 224 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 224 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return LITTLE; } YY_BREAK case 34: YY_RULE_SETUP -#line 225 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 225 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return BIG; } YY_BREAK case 35: YY_RULE_SETUP -#line 226 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 226 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return VOLATILE; } YY_BREAK case 36: YY_RULE_SETUP -#line 227 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 227 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return ALIGN; } YY_BREAK case 37: YY_RULE_SETUP -#line 228 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 228 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return SECTION; } YY_BREAK case 38: YY_RULE_SETUP -#line 229 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 229 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return MODULE; } YY_BREAK case 39: YY_RULE_SETUP -#line 230 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 230 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return ASM_TOK; } YY_BREAK case 40: YY_RULE_SETUP -#line 231 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 231 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return SIDEEFFECT; } YY_BREAK case 41: YY_RULE_SETUP -#line 233 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 233 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return CC_TOK; } YY_BREAK case 42: YY_RULE_SETUP -#line 234 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 234 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return CCC_TOK; } YY_BREAK case 43: YY_RULE_SETUP -#line 235 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 235 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return CSRETCC_TOK; } YY_BREAK case 44: YY_RULE_SETUP -#line 236 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 236 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return FASTCC_TOK; } YY_BREAK case 45: YY_RULE_SETUP -#line 237 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 237 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return COLDCC_TOK; } YY_BREAK case 46: YY_RULE_SETUP -#line 238 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 238 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return X86_STDCALLCC_TOK; } YY_BREAK case 47: YY_RULE_SETUP -#line 239 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 239 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return X86_FASTCALLCC_TOK; } YY_BREAK case 48: YY_RULE_SETUP -#line 241 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 241 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.PrimType = Type::VoidTy ; return VOID; } YY_BREAK case 49: YY_RULE_SETUP -#line 242 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 242 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.PrimType = Type::BoolTy ; return BOOL; } YY_BREAK case 50: YY_RULE_SETUP -#line 243 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 243 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.PrimType = Type::SByteTy ; return SBYTE; } YY_BREAK case 51: YY_RULE_SETUP -#line 244 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 244 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.PrimType = Type::UByteTy ; return UBYTE; } YY_BREAK case 52: YY_RULE_SETUP -#line 245 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 245 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.PrimType = Type::ShortTy ; return SHORT; } YY_BREAK case 53: YY_RULE_SETUP -#line 246 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 246 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.PrimType = Type::UShortTy; return USHORT; } YY_BREAK case 54: YY_RULE_SETUP -#line 247 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 247 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.PrimType = Type::IntTy ; return INT; } YY_BREAK case 55: YY_RULE_SETUP -#line 248 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 248 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.PrimType = Type::UIntTy ; return UINT; } YY_BREAK case 56: YY_RULE_SETUP -#line 249 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 249 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.PrimType = Type::LongTy ; return LONG; } YY_BREAK case 57: YY_RULE_SETUP -#line 250 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 250 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.PrimType = Type::ULongTy ; return ULONG; } YY_BREAK case 58: YY_RULE_SETUP -#line 251 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 251 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.PrimType = Type::FloatTy ; return FLOAT; } YY_BREAK case 59: YY_RULE_SETUP -#line 252 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 252 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.PrimType = Type::DoubleTy; return DOUBLE; } YY_BREAK case 60: YY_RULE_SETUP -#line 253 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 253 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.PrimType = Type::LabelTy ; return LABEL; } YY_BREAK case 61: YY_RULE_SETUP -#line 254 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 254 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return TYPE; } YY_BREAK case 62: YY_RULE_SETUP -#line 255 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 255 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return OPAQUE; } YY_BREAK case 63: YY_RULE_SETUP -#line 257 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 257 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, Add, ADD); } YY_BREAK case 64: YY_RULE_SETUP -#line 258 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 258 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, Sub, SUB); } YY_BREAK case 65: YY_RULE_SETUP -#line 259 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 259 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, Mul, MUL); } YY_BREAK case 66: YY_RULE_SETUP -#line 260 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 260 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK_OBSOLETE(BinaryOpVal, UDiv, UDIV); } YY_BREAK case 67: YY_RULE_SETUP -#line 261 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 261 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, UDiv, UDIV); } YY_BREAK case 68: YY_RULE_SETUP -#line 262 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 262 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, SDiv, SDIV); } YY_BREAK case 69: YY_RULE_SETUP -#line 263 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 263 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, FDiv, FDIV); } YY_BREAK case 70: YY_RULE_SETUP -#line 264 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 264 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK_OBSOLETE(BinaryOpVal, URem, UREM); } YY_BREAK case 71: YY_RULE_SETUP -#line 265 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 265 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, URem, UREM); } YY_BREAK case 72: YY_RULE_SETUP -#line 266 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 266 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, SRem, SREM); } YY_BREAK case 73: YY_RULE_SETUP -#line 267 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 267 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, FRem, FREM); } YY_BREAK case 74: YY_RULE_SETUP -#line 268 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 268 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, And, AND); } YY_BREAK case 75: YY_RULE_SETUP -#line 269 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 269 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, Or , OR ); } YY_BREAK case 76: YY_RULE_SETUP -#line 270 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 270 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, Xor, XOR); } YY_BREAK case 77: YY_RULE_SETUP -#line 271 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 271 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, SetNE, SETNE); } YY_BREAK case 78: YY_RULE_SETUP -#line 272 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 272 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, SetEQ, SETEQ); } YY_BREAK case 79: YY_RULE_SETUP -#line 273 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 273 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, SetLT, SETLT); } YY_BREAK case 80: YY_RULE_SETUP -#line 274 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 274 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, SetGT, SETGT); } YY_BREAK case 81: YY_RULE_SETUP -#line 275 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 275 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, SetLE, SETLE); } YY_BREAK case 82: YY_RULE_SETUP -#line 276 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 276 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(BinaryOpVal, SetGE, SETGE); } YY_BREAK case 83: YY_RULE_SETUP -#line 278 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 278 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(OtherOpVal, PHI, PHI_TOK); } YY_BREAK case 84: YY_RULE_SETUP -#line 279 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 279 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(OtherOpVal, Call, CALL); } YY_BREAK case 85: YY_RULE_SETUP -#line 280 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 280 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(OtherOpVal, Cast, CAST); } YY_BREAK case 86: YY_RULE_SETUP -#line 281 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 281 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(OtherOpVal, Select, SELECT); } YY_BREAK case 87: YY_RULE_SETUP -#line 282 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 282 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(OtherOpVal, Shl, SHL); } YY_BREAK case 88: YY_RULE_SETUP -#line 283 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 283 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(OtherOpVal, Shr, SHR); } YY_BREAK case 89: YY_RULE_SETUP -#line 284 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 284 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return VANEXT_old; } YY_BREAK case 90: YY_RULE_SETUP -#line 285 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 285 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return VAARG_old; } YY_BREAK case 91: YY_RULE_SETUP -#line 286 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 286 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(OtherOpVal, VAArg , VAARG); } YY_BREAK case 92: YY_RULE_SETUP -#line 287 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 287 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(TermOpVal, Ret, RET); } YY_BREAK case 93: YY_RULE_SETUP -#line 288 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 288 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(TermOpVal, Br, BR); } YY_BREAK case 94: YY_RULE_SETUP -#line 289 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 289 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(TermOpVal, Switch, SWITCH); } YY_BREAK case 95: YY_RULE_SETUP -#line 290 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 290 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(TermOpVal, Invoke, INVOKE); } YY_BREAK case 96: YY_RULE_SETUP -#line 291 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 291 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(TermOpVal, Unwind, UNWIND); } YY_BREAK case 97: YY_RULE_SETUP -#line 292 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 292 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(TermOpVal, Unreachable, UNREACHABLE); } YY_BREAK case 98: YY_RULE_SETUP -#line 294 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 294 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(MemOpVal, Malloc, MALLOC); } YY_BREAK case 99: YY_RULE_SETUP -#line 295 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 295 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(MemOpVal, Alloca, ALLOCA); } YY_BREAK case 100: YY_RULE_SETUP -#line 296 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 296 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(MemOpVal, Free, FREE); } YY_BREAK case 101: YY_RULE_SETUP -#line 297 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 297 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(MemOpVal, Load, LOAD); } YY_BREAK case 102: YY_RULE_SETUP -#line 298 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 298 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(MemOpVal, Store, STORE); } YY_BREAK case 103: YY_RULE_SETUP -#line 299 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 299 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(MemOpVal, GetElementPtr, GETELEMENTPTR); } YY_BREAK case 104: YY_RULE_SETUP -#line 301 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 301 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(OtherOpVal, ExtractElement, EXTRACTELEMENT); } YY_BREAK case 105: YY_RULE_SETUP -#line 302 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 302 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(OtherOpVal, InsertElement, INSERTELEMENT); } YY_BREAK case 106: YY_RULE_SETUP -#line 303 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 303 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { RET_TOK(OtherOpVal, ShuffleVector, SHUFFLEVECTOR); } YY_BREAK case 107: YY_RULE_SETUP -#line 306 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 306 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { UnEscapeLexed(yytext+1); llvmAsmlval.StrVal = strdup(yytext+1); // Skip % @@ -1791,7 +1782,7 @@ YY_RULE_SETUP YY_BREAK case 108: YY_RULE_SETUP -#line 311 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 311 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { yytext[strlen(yytext)-1] = 0; // nuke colon UnEscapeLexed(yytext); @@ -1801,7 +1792,7 @@ YY_RULE_SETUP YY_BREAK case 109: YY_RULE_SETUP -#line 317 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 317 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { yytext[strlen(yytext)-2] = 0; // nuke colon, end quote UnEscapeLexed(yytext+1); @@ -1811,7 +1802,7 @@ YY_RULE_SETUP YY_BREAK case 110: YY_RULE_SETUP -#line 324 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 324 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { // Note that we cannot unescape a string constant here! The // string constant might contain a \00 which would not be // understood by the string stuff. It is valid to make a @@ -1824,12 +1815,12 @@ YY_RULE_SETUP YY_BREAK case 111: YY_RULE_SETUP -#line 335 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 335 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.UInt64Val = atoull(yytext); return EUINT64VAL; } YY_BREAK case 112: YY_RULE_SETUP -#line 336 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 336 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { uint64_t Val = atoull(yytext+1); // +1: we have bigger negative range @@ -1841,7 +1832,7 @@ YY_RULE_SETUP YY_BREAK case 113: YY_RULE_SETUP -#line 344 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 344 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.UInt64Val = HexIntToVal(yytext+3); return yytext[0] == 's' ? ESINT64VAL : EUINT64VAL; @@ -1849,7 +1840,7 @@ YY_RULE_SETUP YY_BREAK case 114: YY_RULE_SETUP -#line 349 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 349 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { uint64_t Val = atoull(yytext+1); if ((unsigned)Val != Val) @@ -1860,7 +1851,7 @@ YY_RULE_SETUP YY_BREAK case 115: YY_RULE_SETUP -#line 356 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 356 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { uint64_t Val = atoull(yytext+2); // +1: we have bigger negative range @@ -1872,16 +1863,16 @@ YY_RULE_SETUP YY_BREAK case 116: YY_RULE_SETUP -#line 365 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 365 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.FPVal = atof(yytext); return FPVAL; } YY_BREAK case 117: YY_RULE_SETUP -#line 366 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 366 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { llvmAsmlval.FPVal = HexToFP(yytext); return FPVAL; } YY_BREAK case YY_STATE_EOF(INITIAL): -#line 368 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 368 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { /* Make sure to free the internal buffers for flex when we are * done reading our input! @@ -1892,20 +1883,20 @@ case YY_STATE_EOF(INITIAL): YY_BREAK case 118: YY_RULE_SETUP -#line 376 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 376 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { /* Ignore whitespace */ } YY_BREAK case 119: YY_RULE_SETUP -#line 377 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 377 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" { return yytext[0]; } YY_BREAK case 120: YY_RULE_SETUP -#line 379 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 379 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" YY_FATAL_ERROR( "flex scanner jammed" ); YY_BREAK -#line 1909 "Lexer.cpp" +#line 1900 "Lexer.cpp" case YY_END_OF_BUFFER: { @@ -2281,7 +2272,6 @@ register char *yy_bp; #endif /* ifndef YY_NO_UNPUT */ -#ifndef YY_NO_INPUT #ifdef __cplusplus static int yyinput() #else @@ -2355,7 +2345,7 @@ static int input() return c; } -#endif /* YY_NO_INPUT */ + #ifdef YY_USE_PROTOS void yyrestart( FILE *input_file ) @@ -2466,6 +2456,11 @@ YY_BUFFER_STATE b; } +#ifndef YY_ALWAYS_INTERACTIVE +#ifndef YY_NEVER_INTERACTIVE +extern int isatty YY_PROTO(( int )); +#endif +#endif #ifdef YY_USE_PROTOS void yy_init_buffer( YY_BUFFER_STATE b, FILE *file ) @@ -2783,5 +2778,5 @@ int main() return 0; } #endif -#line 379 "/proj/llvm/llvm-4/lib/AsmParser/Lexer.l" +#line 379 "/Users/sabre/cvs/llvm/lib/AsmParser/Lexer.l" diff --git a/llvm/lib/AsmParser/llvmAsmParser.cpp.cvs b/llvm/lib/AsmParser/llvmAsmParser.cpp.cvs index f8dba72..21a722f 100644 --- a/llvm/lib/AsmParser/llvmAsmParser.cpp.cvs +++ b/llvm/lib/AsmParser/llvmAsmParser.cpp.cvs @@ -1,298 +1,128 @@ -/* A Bison parser, made by GNU Bison 2.1. */ -/* Skeleton parser for Yacc-like parsing with Bison, - Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc. +/* A Bison parser, made from /Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y + by GNU Bison version 1.28 */ - 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., 51 Franklin Street, Fifth Floor, - Boston, MA 02110-1301, USA. */ +#define YYBISON 1 /* Identify Bison output. */ -/* 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 - -/* Bison version. */ -#define YYBISON_VERSION "2.1" - -/* Skeleton name. */ -#define YYSKELETON_NAME "yacc.c" - -/* Pure parsers. */ -#define YYPURE 0 - -/* Using locations. */ -#define YYLSP_NEEDED 0 - -/* Substitute the variable and function names. */ #define yyparse llvmAsmparse -#define yylex llvmAsmlex +#define yylex llvmAsmlex #define yyerror llvmAsmerror -#define yylval llvmAsmlval -#define yychar llvmAsmchar +#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, - SECTION = 289, - VOLATILE = 290, - TO = 291, - DOTDOTDOT = 292, - NULL_TOK = 293, - UNDEF = 294, - CONST = 295, - INTERNAL = 296, - LINKONCE = 297, - WEAK = 298, - APPENDING = 299, - DLLIMPORT = 300, - DLLEXPORT = 301, - EXTERN_WEAK = 302, - OPAQUE = 303, - NOT = 304, - EXTERNAL = 305, - TARGET = 306, - TRIPLE = 307, - ENDIAN = 308, - POINTERSIZE = 309, - LITTLE = 310, - BIG = 311, - ALIGN = 312, - DEPLIBS = 313, - CALL = 314, - TAIL = 315, - ASM_TOK = 316, - MODULE = 317, - SIDEEFFECT = 318, - CC_TOK = 319, - CCC_TOK = 320, - CSRETCC_TOK = 321, - FASTCC_TOK = 322, - COLDCC_TOK = 323, - X86_STDCALLCC_TOK = 324, - X86_FASTCALLCC_TOK = 325, - DATALAYOUT = 326, - RET = 327, - BR = 328, - SWITCH = 329, - INVOKE = 330, - UNWIND = 331, - UNREACHABLE = 332, - ADD = 333, - SUB = 334, - MUL = 335, - UDIV = 336, - SDIV = 337, - FDIV = 338, - UREM = 339, - SREM = 340, - FREM = 341, - AND = 342, - OR = 343, - XOR = 344, - SETLE = 345, - SETGE = 346, - SETLT = 347, - SETGT = 348, - SETEQ = 349, - SETNE = 350, - MALLOC = 351, - ALLOCA = 352, - FREE = 353, - LOAD = 354, - STORE = 355, - GETELEMENTPTR = 356, - PHI_TOK = 357, - CAST = 358, - SELECT = 359, - SHL = 360, - SHR = 361, - VAARG = 362, - EXTRACTELEMENT = 363, - INSERTELEMENT = 364, - SHUFFLEVECTOR = 365, - VAARG_old = 366, - VANEXT_old = 367 - }; -#endif -/* Tokens. */ -#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 SECTION 289 -#define VOLATILE 290 -#define TO 291 -#define DOTDOTDOT 292 -#define NULL_TOK 293 -#define UNDEF 294 -#define CONST 295 -#define INTERNAL 296 -#define LINKONCE 297 -#define WEAK 298 -#define APPENDING 299 -#define DLLIMPORT 300 -#define DLLEXPORT 301 -#define EXTERN_WEAK 302 -#define OPAQUE 303 -#define NOT 304 -#define EXTERNAL 305 -#define TARGET 306 -#define TRIPLE 307 -#define ENDIAN 308 -#define POINTERSIZE 309 -#define LITTLE 310 -#define BIG 311 -#define ALIGN 312 -#define DEPLIBS 313 -#define CALL 314 -#define TAIL 315 -#define ASM_TOK 316 -#define MODULE 317 -#define SIDEEFFECT 318 -#define CC_TOK 319 -#define CCC_TOK 320 -#define CSRETCC_TOK 321 -#define FASTCC_TOK 322 -#define COLDCC_TOK 323 -#define X86_STDCALLCC_TOK 324 -#define X86_FASTCALLCC_TOK 325 -#define DATALAYOUT 326 -#define RET 327 -#define BR 328 -#define SWITCH 329 -#define INVOKE 330 -#define UNWIND 331 -#define UNREACHABLE 332 -#define ADD 333 -#define SUB 334 -#define MUL 335 -#define UDIV 336 -#define SDIV 337 -#define FDIV 338 -#define UREM 339 -#define SREM 340 -#define FREM 341 -#define AND 342 -#define OR 343 -#define XOR 344 -#define SETLE 345 -#define SETGE 346 -#define SETLT 347 -#define SETGT 348 -#define SETEQ 349 -#define SETNE 350 -#define MALLOC 351 -#define ALLOCA 352 -#define FREE 353 -#define LOAD 354 -#define STORE 355 -#define GETELEMENTPTR 356 -#define PHI_TOK 357 -#define CAST 358 -#define SELECT 359 -#define SHL 360 -#define SHR 361 -#define VAARG 362 -#define EXTRACTELEMENT 363 -#define INSERTELEMENT 364 -#define SHUFFLEVECTOR 365 -#define VAARG_old 366 -#define VANEXT_old 367 - - - - -/* Copy the first part of user declarations. */ -#line 14 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" +#define ESINT64VAL 257 +#define EUINT64VAL 258 +#define SINTVAL 259 +#define UINTVAL 260 +#define FPVAL 261 +#define VOID 262 +#define BOOL 263 +#define SBYTE 264 +#define UBYTE 265 +#define SHORT 266 +#define USHORT 267 +#define INT 268 +#define UINT 269 +#define LONG 270 +#define ULONG 271 +#define FLOAT 272 +#define DOUBLE 273 +#define TYPE 274 +#define LABEL 275 +#define VAR_ID 276 +#define LABELSTR 277 +#define STRINGCONSTANT 278 +#define IMPLEMENTATION 279 +#define ZEROINITIALIZER 280 +#define TRUETOK 281 +#define FALSETOK 282 +#define BEGINTOK 283 +#define ENDTOK 284 +#define DECLARE 285 +#define GLOBAL 286 +#define CONSTANT 287 +#define SECTION 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 DLLIMPORT 299 +#define DLLEXPORT 300 +#define EXTERN_WEAK 301 +#define OPAQUE 302 +#define NOT 303 +#define EXTERNAL 304 +#define TARGET 305 +#define TRIPLE 306 +#define ENDIAN 307 +#define POINTERSIZE 308 +#define LITTLE 309 +#define BIG 310 +#define ALIGN 311 +#define DEPLIBS 312 +#define CALL 313 +#define TAIL 314 +#define ASM_TOK 315 +#define MODULE 316 +#define SIDEEFFECT 317 +#define CC_TOK 318 +#define CCC_TOK 319 +#define CSRETCC_TOK 320 +#define FASTCC_TOK 321 +#define COLDCC_TOK 322 +#define X86_STDCALLCC_TOK 323 +#define X86_FASTCALLCC_TOK 324 +#define DATALAYOUT 325 +#define RET 326 +#define BR 327 +#define SWITCH 328 +#define INVOKE 329 +#define UNWIND 330 +#define UNREACHABLE 331 +#define ADD 332 +#define SUB 333 +#define MUL 334 +#define UDIV 335 +#define SDIV 336 +#define FDIV 337 +#define UREM 338 +#define SREM 339 +#define FREM 340 +#define AND 341 +#define OR 342 +#define XOR 343 +#define SETLE 344 +#define SETGE 345 +#define SETLT 346 +#define SETGT 347 +#define SETEQ 348 +#define SETNE 349 +#define MALLOC 350 +#define ALLOCA 351 +#define FREE 352 +#define LOAD 353 +#define STORE 354 +#define GETELEMENTPTR 355 +#define PHI_TOK 356 +#define CAST 357 +#define SELECT 358 +#define SHL 359 +#define SHR 360 +#define VAARG 361 +#define EXTRACTELEMENT 362 +#define INSERTELEMENT 363 +#define SHUFFLEVECTOR 364 +#define VAARG_old 365 +#define VANEXT_old 366 + +#line 14 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" #include "ParserInternals.h" #include "llvm/CallingConv.h" @@ -1294,28 +1124,8 @@ Module *llvm::RunVMAsmParser(const char * AsmString, Module * 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 - -/* Enabling the token table. */ -#ifndef YYTOKEN_TABLE -# define YYTOKEN_TABLE 0 -#endif - -#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) -#line 1016 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" -typedef union YYSTYPE { +#line 1016 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +typedef union { llvm::Module *ModuleVal; llvm::Function *FunctionVal; std::pair<llvm::PATypeHolder*, char*> *ArgVal; @@ -1354,1466 +1164,1011 @@ typedef union YYSTYPE { OtherOpInfo OtherOpVal; llvm::Module::Endianness Endianness; } YYSTYPE; -/* Line 196 of yacc.c. */ -#line 1359 "llvmAsmParser.tab.c" -# define yystype YYSTYPE /* obsolescent; will be withdrawn */ -# define YYSTYPE_IS_DECLARED 1 -# define YYSTYPE_IS_TRIVIAL 1 -#endif - - +#include <stdio.h> -/* Copy the second part of user declarations. */ - - -/* Line 219 of yacc.c. */ -#line 1371 "llvmAsmParser.tab.c" - -#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 +#ifndef __cplusplus +#ifndef __STDC__ +#define const #endif -#if ! defined (YYSIZE_T) && (defined (__STDC__) || defined (__cplusplus)) -# include <stddef.h> /* INFRINGES ON USER NAME SPACE */ -# define YYSIZE_T size_t -#endif -#if ! defined (YYSIZE_T) -# define YYSIZE_T unsigned int -#endif - -#ifndef YY_ -# if YYENABLE_NLS -# if ENABLE_NLS -# include <libintl.h> /* INFRINGES ON USER NAME SPACE */ -# define YY_(msgid) dgettext ("bison-runtime", msgid) -# endif -# endif -# ifndef YY_ -# define YY_(msgid) msgid -# endif #endif -#if ! defined (yyoverflow) || YYERROR_VERBOSE - -/* The parser invokes alloca or malloc; define the necessary symbols. */ - -# ifdef YYSTACK_USE_ALLOCA -# if YYSTACK_USE_ALLOCA -# ifdef __GNUC__ -# define YYSTACK_ALLOC __builtin_alloca -# else -# define YYSTACK_ALLOC alloca -# if defined (__STDC__) || defined (__cplusplus) -# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ -# define YYINCLUDED_STDLIB_H -# endif -# endif -# endif -# endif - -# ifdef YYSTACK_ALLOC - /* Pacify GCC's `empty if-body' warning. */ -# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) -# ifndef YYSTACK_ALLOC_MAXIMUM - /* The OS might guarantee only one guard page at the bottom of the stack, - and a page size can be as small as 4096 bytes. So we cannot safely - invoke alloca (N) if N exceeds 4096. Use a slightly smaller number - to allow for a few compiler-allocated temporary stack slots. */ -# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2005 */ -# endif -# else -# define YYSTACK_ALLOC YYMALLOC -# define YYSTACK_FREE YYFREE -# ifndef YYSTACK_ALLOC_MAXIMUM -# define YYSTACK_ALLOC_MAXIMUM ((YYSIZE_T) -1) -# endif -# ifdef __cplusplus -extern "C" { -# endif -# ifndef YYMALLOC -# define YYMALLOC malloc -# if (! defined (malloc) && ! defined (YYINCLUDED_STDLIB_H) \ - && (defined (__STDC__) || defined (__cplusplus))) -void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ -# endif -# endif -# ifndef YYFREE -# define YYFREE free -# if (! defined (free) && ! defined (YYINCLUDED_STDLIB_H) \ - && (defined (__STDC__) || defined (__cplusplus))) -void free (void *); /* INFRINGES ON USER NAME SPACE */ -# endif -# endif -# ifdef __cplusplus -} -# endif -# endif -#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */ -#if (! defined (yyoverflow) \ - && (! defined (__cplusplus) \ - || (defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL))) +#define YYFINAL 521 +#define YYFLAG -32768 +#define YYNTBASE 127 + +#define YYTRANSLATE(x) ((unsigned)(x) <= 366 ? yytranslate[x] : 201) + +static const short 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, 116, + 117, 125, 2, 114, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 121, + 113, 122, 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, + 118, 115, 120, 2, 2, 2, 2, 2, 126, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 119, + 2, 2, 123, 2, 124, 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, 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, 94, 95, 96, + 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, + 107, 108, 109, 110, 111, 112 +}; -/* A type that is properly aligned for any stack member. */ -union yyalloc -{ - short int yyss; - YYSTYPE yyvs; - }; +#if YYDEBUG != 0 +static const short yyprhs[] = { 0, + 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, + 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, + 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, + 60, 62, 64, 66, 68, 70, 72, 75, 76, 78, + 80, 82, 84, 86, 88, 90, 91, 92, 94, 96, + 98, 100, 102, 104, 107, 108, 111, 112, 116, 119, + 120, 122, 123, 127, 129, 132, 134, 136, 138, 140, + 142, 144, 146, 148, 150, 152, 154, 156, 158, 160, + 162, 164, 166, 168, 170, 172, 174, 177, 182, 188, + 194, 198, 201, 204, 206, 210, 212, 216, 218, 219, + 224, 228, 232, 237, 242, 246, 249, 252, 255, 258, + 261, 264, 267, 270, 273, 276, 283, 289, 298, 305, + 312, 319, 326, 333, 342, 351, 355, 357, 359, 361, + 363, 366, 369, 374, 377, 379, 384, 387, 392, 393, + 401, 402, 410, 411, 419, 420, 428, 432, 437, 438, + 440, 442, 444, 448, 452, 456, 460, 464, 468, 470, + 471, 473, 475, 477, 478, 481, 485, 487, 489, 493, + 495, 496, 505, 507, 509, 513, 515, 517, 520, 521, + 523, 525, 526, 531, 532, 534, 536, 538, 540, 542, + 544, 546, 548, 550, 554, 556, 562, 564, 566, 568, + 570, 573, 576, 579, 583, 586, 587, 589, 592, 595, + 599, 609, 619, 628, 642, 644, 646, 653, 659, 662, + 669, 677, 679, 683, 685, 686, 689, 691, 697, 703, + 709, 712, 717, 722, 729, 734, 739, 744, 749, 756, + 763, 766, 774, 776, 779, 780, 782, 783, 787, 794, + 798, 805, 808, 813, 820 +}; -/* 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 int) + 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 \ - { \ - 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) +static const short yyrhs[] = { 5, + 0, 6, 0, 3, 0, 4, 0, 78, 0, 79, + 0, 80, 0, 81, 0, 82, 0, 83, 0, 84, + 0, 85, 0, 86, 0, 87, 0, 88, 0, 89, + 0, 90, 0, 91, 0, 92, 0, 93, 0, 94, + 0, 95, 0, 105, 0, 106, 0, 16, 0, 14, + 0, 12, 0, 10, 0, 17, 0, 15, 0, 13, + 0, 11, 0, 133, 0, 134, 0, 18, 0, 19, + 0, 169, 113, 0, 0, 41, 0, 42, 0, 43, + 0, 44, 0, 45, 0, 46, 0, 47, 0, 0, + 0, 65, 0, 66, 0, 67, 0, 68, 0, 69, + 0, 70, 0, 64, 4, 0, 0, 57, 4, 0, + 0, 114, 57, 4, 0, 34, 24, 0, 0, 142, + 0, 0, 114, 145, 144, 0, 142, 0, 57, 4, + 0, 148, 0, 8, 0, 150, 0, 8, 0, 150, + 0, 9, 0, 10, 0, 11, 0, 12, 0, 13, + 0, 14, 0, 15, 0, 16, 0, 17, 0, 18, + 0, 19, 0, 20, 0, 21, 0, 48, 0, 149, + 0, 184, 0, 115, 4, 0, 147, 116, 152, 117, + 0, 118, 4, 119, 150, 120, 0, 121, 4, 119, + 150, 122, 0, 123, 151, 124, 0, 123, 124, 0, + 150, 125, 0, 150, 0, 151, 114, 150, 0, 151, + 0, 151, 114, 37, 0, 37, 0, 0, 148, 118, + 155, 120, 0, 148, 118, 120, 0, 148, 126, 24, + 0, 148, 121, 155, 122, 0, 148, 123, 155, 124, + 0, 148, 123, 124, 0, 148, 38, 0, 148, 39, + 0, 148, 184, 0, 148, 154, 0, 148, 26, 0, + 133, 128, 0, 134, 4, 0, 9, 27, 0, 9, + 28, 0, 136, 7, 0, 103, 116, 153, 36, 148, + 117, 0, 101, 116, 153, 198, 117, 0, 104, 116, + 153, 114, 153, 114, 153, 117, 0, 129, 116, 153, + 114, 153, 117, 0, 130, 116, 153, 114, 153, 117, + 0, 131, 116, 153, 114, 153, 117, 0, 132, 116, + 153, 114, 153, 117, 0, 108, 116, 153, 114, 153, + 117, 0, 109, 116, 153, 114, 153, 114, 153, 117, + 0, 110, 116, 153, 114, 153, 114, 153, 117, 0, + 155, 114, 153, 0, 153, 0, 32, 0, 33, 0, + 158, 0, 158, 178, 0, 158, 180, 0, 158, 62, + 61, 164, 0, 158, 25, 0, 159, 0, 159, 137, + 20, 146, 0, 159, 180, 0, 159, 62, 61, 164, + 0, 0, 159, 137, 138, 156, 153, 160, 144, 0, + 0, 159, 137, 50, 156, 148, 161, 144, 0, 0, + 159, 137, 45, 156, 148, 162, 144, 0, 0, 159, + 137, 47, 156, 148, 163, 144, 0, 159, 51, 166, + 0, 159, 58, 113, 167, 0, 0, 24, 0, 56, + 0, 55, 0, 53, 113, 165, 0, 54, 113, 4, + 0, 52, 113, 24, 0, 71, 113, 24, 0, 118, + 168, 120, 0, 168, 114, 24, 0, 24, 0, 0, + 22, 0, 24, 0, 169, 0, 0, 148, 170, 0, + 172, 114, 171, 0, 171, 0, 172, 0, 172, 114, + 37, 0, 37, 0, 0, 139, 146, 169, 116, 173, + 117, 143, 140, 0, 29, 0, 123, 0, 138, 174, + 175, 0, 30, 0, 124, 0, 187, 177, 0, 0, + 45, 0, 47, 0, 0, 31, 181, 179, 174, 0, + 0, 63, 0, 3, 0, 4, 0, 7, 0, 27, + 0, 28, 0, 38, 0, 39, 0, 26, 0, 121, + 155, 122, 0, 154, 0, 61, 182, 24, 114, 24, + 0, 127, 0, 169, 0, 184, 0, 183, 0, 148, + 185, 0, 187, 188, 0, 176, 188, 0, 189, 137, + 190, 0, 189, 192, 0, 0, 23, 0, 72, 186, + 0, 72, 8, 0, 73, 21, 185, 0, 73, 9, + 185, 114, 21, 185, 114, 21, 185, 0, 74, 135, + 185, 114, 21, 185, 118, 191, 120, 0, 74, 135, + 185, 114, 21, 185, 118, 120, 0, 75, 139, 146, + 185, 116, 195, 117, 36, 21, 185, 76, 21, 185, + 0, 76, 0, 77, 0, 191, 135, 183, 114, 21, + 185, 0, 135, 183, 114, 21, 185, 0, 137, 197, + 0, 148, 118, 185, 114, 185, 120, 0, 193, 114, + 118, 185, 114, 185, 120, 0, 186, 0, 194, 114, + 186, 0, 194, 0, 0, 60, 59, 0, 59, 0, + 129, 148, 185, 114, 185, 0, 130, 148, 185, 114, + 185, 0, 131, 148, 185, 114, 185, 0, 49, 186, + 0, 132, 186, 114, 186, 0, 103, 186, 36, 148, + 0, 104, 186, 114, 186, 114, 186, 0, 107, 186, + 114, 148, 0, 111, 186, 114, 148, 0, 112, 186, + 114, 148, 0, 108, 186, 114, 186, 0, 109, 186, + 114, 186, 114, 186, 0, 110, 186, 114, 186, 114, + 186, 0, 102, 193, 0, 196, 139, 146, 185, 116, + 195, 117, 0, 200, 0, 114, 194, 0, 0, 35, + 0, 0, 96, 148, 141, 0, 96, 148, 114, 15, + 185, 141, 0, 97, 148, 141, 0, 97, 148, 114, + 15, 185, 141, 0, 98, 186, 0, 199, 99, 148, + 185, 0, 199, 100, 186, 114, 148, 185, 0, 101, + 148, 185, 198, 0 +}; #endif -#if defined (__STDC__) || defined (__cplusplus) - typedef signed char yysigned_char; -#else - typedef short int yysigned_char; +#if YYDEBUG != 0 +static const short yyrline[] = { 0, + 1139, 1140, 1148, 1149, 1159, 1159, 1159, 1159, 1159, 1159, + 1159, 1159, 1159, 1160, 1160, 1160, 1161, 1161, 1161, 1161, + 1161, 1161, 1163, 1163, 1167, 1167, 1167, 1167, 1168, 1168, + 1168, 1168, 1169, 1169, 1170, 1170, 1173, 1177, 1182, 1182, + 1183, 1184, 1185, 1186, 1187, 1188, 1191, 1191, 1192, 1193, + 1194, 1195, 1196, 1197, 1207, 1207, 1214, 1214, 1223, 1231, + 1231, 1237, 1237, 1239, 1244, 1258, 1258, 1259, 1259, 1261, + 1271, 1271, 1271, 1271, 1271, 1271, 1271, 1272, 1272, 1272, + 1272, 1272, 1272, 1273, 1277, 1281, 1289, 1297, 1310, 1315, + 1327, 1337, 1341, 1352, 1357, 1363, 1364, 1368, 1372, 1383, + 1409, 1423, 1453, 1479, 1500, 1513, 1523, 1528, 1589, 1596, + 1605, 1611, 1617, 1621, 1625, 1633, 1644, 1676, 1684, 1711, + 1722, 1728, 1736, 1742, 1748, 1757, 1761, 1769, 1769, 1779, + 1787, 1792, 1796, 1800, 1804, 1819, 1841, 1844, 1847, 1852, + 1855, 1859, 1863, 1867, 1871, 1876, 1880, 1883, 1886, 1890, + 1903, 1904, 1906, 1910, 1919, 1923, 1928, 1930, 1935, 1940, + 1949, 1949, 1950, 1950, 1952, 1959, 1965, 1972, 1976, 1982, + 1987, 1992, 2087, 2087, 2089, 2097, 2097, 2099, 2104, 2104, + 2105, 2108, 2108, 2118, 2122, 2127, 2131, 2135, 2139, 2143, + 2147, 2151, 2155, 2159, 2184, 2188, 2202, 2206, 2212, 2212, + 2218, 2223, 2227, 2236, 2247, 2252, 2264, 2277, 2281, 2285, + 2290, 2299, 2318, 2327, 2383, 2387, 2394, 2405, 2418, 2427, + 2436, 2446, 2450, 2457, 2457, 2459, 2463, 2468, 2490, 2505, + 2519, 2532, 2540, 2548, 2556, 2562, 2582, 2605, 2611, 2617, + 2623, 2638, 2697, 2704, 2707, 2712, 2716, 2723, 2728, 2734, + 2739, 2745, 2753, 2765, 2780 +}; #endif -/* YYFINAL -- State number of the termination state. */ -#define YYFINAL 4 -/* YYLAST -- Last index in YYTABLE. */ -#define YYLAST 1357 - -/* YYNTOKENS -- Number of terminals. */ -#define YYNTOKENS 127 -/* YYNNTS -- Number of nonterminals. */ -#define YYNNTS 75 -/* YYNRULES -- Number of rules. */ -#define YYNRULES 256 -/* YYNRULES -- Number of states. */ -#define YYNSTATES 521 - -/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ -#define YYUNDEFTOK 2 -#define YYMAXUTOK 367 - -#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, - 116, 117, 125, 2, 114, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 121, 113, 122, 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, 118, 115, 120, 2, 2, 2, 2, 2, 126, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 119, 2, 2, 123, 2, 124, 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, 94, - 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, - 105, 106, 107, 108, 109, 110, 111, 112 -}; -#if YYDEBUG -/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in - YYRHS. */ -static const unsigned short int 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, 69, 71, 73, 75, 78, - 79, 81, 83, 85, 87, 89, 91, 93, 94, 95, - 97, 99, 101, 103, 105, 107, 110, 111, 114, 115, - 119, 122, 123, 125, 126, 130, 132, 135, 137, 139, - 141, 143, 145, 147, 149, 151, 153, 155, 157, 159, - 161, 163, 165, 167, 169, 171, 173, 175, 177, 180, - 185, 191, 197, 201, 204, 207, 209, 213, 215, 219, - 221, 222, 227, 231, 235, 240, 245, 249, 252, 255, - 258, 261, 264, 267, 270, 273, 276, 279, 286, 292, - 301, 308, 315, 322, 329, 336, 345, 354, 358, 360, - 362, 364, 366, 369, 372, 377, 380, 382, 387, 390, - 395, 396, 404, 405, 413, 414, 422, 423, 431, 435, - 440, 441, 443, 445, 447, 451, 455, 459, 463, 467, - 471, 473, 474, 476, 478, 480, 481, 484, 488, 490, - 492, 496, 498, 499, 508, 510, 512, 516, 518, 520, - 523, 524, 526, 528, 529, 534, 535, 537, 539, 541, - 543, 545, 547, 549, 551, 553, 557, 559, 565, 567, - 569, 571, 573, 576, 579, 582, 586, 589, 590, 592, - 595, 598, 602, 612, 622, 631, 645, 647, 649, 656, - 662, 665, 672, 680, 682, 686, 688, 689, 692, 694, - 700, 706, 712, 715, 720, 725, 732, 737, 742, 747, - 752, 759, 766, 769, 777, 779, 782, 783, 785, 786, - 790, 797, 801, 808, 811, 816, 823 +#if YYDEBUG != 0 || defined (YYERROR_VERBOSE) + +static const char * const yytname[] = { "$","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","SECTION","VOLATILE","TO", +"DOTDOTDOT","NULL_TOK","UNDEF","CONST","INTERNAL","LINKONCE","WEAK","APPENDING", +"DLLIMPORT","DLLEXPORT","EXTERN_WEAK","OPAQUE","NOT","EXTERNAL","TARGET","TRIPLE", +"ENDIAN","POINTERSIZE","LITTLE","BIG","ALIGN","DEPLIBS","CALL","TAIL","ASM_TOK", +"MODULE","SIDEEFFECT","CC_TOK","CCC_TOK","CSRETCC_TOK","FASTCC_TOK","COLDCC_TOK", +"X86_STDCALLCC_TOK","X86_FASTCALLCC_TOK","DATALAYOUT","RET","BR","SWITCH","INVOKE", +"UNWIND","UNREACHABLE","ADD","SUB","MUL","UDIV","SDIV","FDIV","UREM","SREM", +"FREM","AND","OR","XOR","SETLE","SETGE","SETLT","SETGT","SETEQ","SETNE","MALLOC", +"ALLOCA","FREE","LOAD","STORE","GETELEMENTPTR","PHI_TOK","CAST","SELECT","SHL", +"SHR","VAARG","EXTRACTELEMENT","INSERTELEMENT","SHUFFLEVECTOR","VAARG_old","VANEXT_old", +"'='","','","'\\\\'","'('","')'","'['","'x'","']'","'<'","'>'","'{'","'}'","'*'", +"'c'","INTVAL","EINT64VAL","ArithmeticOps","LogicalOps","SetCondOps","ShiftOps", +"SIntType","UIntType","IntType","FPType","OptAssign","OptLinkage","OptCallingConv", +"OptAlign","OptCAlign","SectionString","OptSection","GlobalVarAttributes","GlobalVarAttribute", +"TypesV","UpRTypesV","Types","PrimType","UpRTypes","TypeListI","ArgTypeListI", +"ConstVal","ConstExpr","ConstVector","GlobalType","Module","FunctionList","ConstPool", +"@1","@2","@3","@4","AsmBlock","BigOrLittle","TargetDefinition","LibrariesDefinition", +"LibList","Name","OptName","ArgVal","ArgListH","ArgList","FunctionHeaderH","BEGIN", +"FunctionHeader","END","Function","FnDeclareLinkage","FunctionProto","@5","OptSideEffect", +"ConstValueRef","SymbolicValueRef","ValueRef","ResolvedVal","BasicBlockList", +"BasicBlock","InstructionList","BBTerminatorInst","JumpTable","Inst","PHIList", +"ValueRefList","ValueRefListE","OptTailCall","InstVal","IndexList","OptVolatile", +"MemoryInst", NULL }; +#endif -/* YYRHS -- A `-1'-separated list of the rules' RHS. */ -static const short int yyrhs[] = -{ - 158, 0, -1, 5, -1, 6, -1, 3, -1, 4, - -1, 78, -1, 79, -1, 80, -1, 81, -1, 82, - -1, 83, -1, 84, -1, 85, -1, 86, -1, 87, - -1, 88, -1, 89, -1, 90, -1, 91, -1, 92, - -1, 93, -1, 94, -1, 95, -1, 105, -1, 106, - -1, 16, -1, 14, -1, 12, -1, 10, -1, 17, - -1, 15, -1, 13, -1, 11, -1, 134, -1, 135, - -1, 18, -1, 19, -1, 170, 113, -1, -1, 41, - -1, 42, -1, 43, -1, 44, -1, 45, -1, 46, - -1, 47, -1, -1, -1, 65, -1, 66, -1, 67, - -1, 68, -1, 69, -1, 70, -1, 64, 4, -1, - -1, 57, 4, -1, -1, 114, 57, 4, -1, 34, - 24, -1, -1, 143, -1, -1, 114, 146, 145, -1, - 143, -1, 57, 4, -1, 149, -1, 8, -1, 151, - -1, 8, -1, 151, -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, 48, -1, 150, -1, 185, -1, 115, 4, -1, - 148, 116, 153, 117, -1, 118, 4, 119, 151, 120, - -1, 121, 4, 119, 151, 122, -1, 123, 152, 124, - -1, 123, 124, -1, 151, 125, -1, 151, -1, 152, - 114, 151, -1, 152, -1, 152, 114, 37, -1, 37, - -1, -1, 149, 118, 156, 120, -1, 149, 118, 120, - -1, 149, 126, 24, -1, 149, 121, 156, 122, -1, - 149, 123, 156, 124, -1, 149, 123, 124, -1, 149, - 38, -1, 149, 39, -1, 149, 185, -1, 149, 155, - -1, 149, 26, -1, 134, 129, -1, 135, 4, -1, - 9, 27, -1, 9, 28, -1, 137, 7, -1, 103, - 116, 154, 36, 149, 117, -1, 101, 116, 154, 199, - 117, -1, 104, 116, 154, 114, 154, 114, 154, 117, - -1, 130, 116, 154, 114, 154, 117, -1, 131, 116, - 154, 114, 154, 117, -1, 132, 116, 154, 114, 154, - 117, -1, 133, 116, 154, 114, 154, 117, -1, 108, - 116, 154, 114, 154, 117, -1, 109, 116, 154, 114, - 154, 114, 154, 117, -1, 110, 116, 154, 114, 154, - 114, 154, 117, -1, 156, 114, 154, -1, 154, -1, - 32, -1, 33, -1, 159, -1, 159, 179, -1, 159, - 181, -1, 159, 62, 61, 165, -1, 159, 25, -1, - 160, -1, 160, 138, 20, 147, -1, 160, 181, -1, - 160, 62, 61, 165, -1, -1, 160, 138, 139, 157, - 154, 161, 145, -1, -1, 160, 138, 50, 157, 149, - 162, 145, -1, -1, 160, 138, 45, 157, 149, 163, - 145, -1, -1, 160, 138, 47, 157, 149, 164, 145, - -1, 160, 51, 167, -1, 160, 58, 113, 168, -1, - -1, 24, -1, 56, -1, 55, -1, 53, 113, 166, - -1, 54, 113, 4, -1, 52, 113, 24, -1, 71, - 113, 24, -1, 118, 169, 120, -1, 169, 114, 24, - -1, 24, -1, -1, 22, -1, 24, -1, 170, -1, - -1, 149, 171, -1, 173, 114, 172, -1, 172, -1, - 173, -1, 173, 114, 37, -1, 37, -1, -1, 140, - 147, 170, 116, 174, 117, 144, 141, -1, 29, -1, - 123, -1, 139, 175, 176, -1, 30, -1, 124, -1, - 188, 178, -1, -1, 45, -1, 47, -1, -1, 31, - 182, 180, 175, -1, -1, 63, -1, 3, -1, 4, - -1, 7, -1, 27, -1, 28, -1, 38, -1, 39, - -1, 26, -1, 121, 156, 122, -1, 155, -1, 61, - 183, 24, 114, 24, -1, 128, -1, 170, -1, 185, - -1, 184, -1, 149, 186, -1, 188, 189, -1, 177, - 189, -1, 190, 138, 191, -1, 190, 193, -1, -1, - 23, -1, 72, 187, -1, 72, 8, -1, 73, 21, - 186, -1, 73, 9, 186, 114, 21, 186, 114, 21, - 186, -1, 74, 136, 186, 114, 21, 186, 118, 192, - 120, -1, 74, 136, 186, 114, 21, 186, 118, 120, - -1, 75, 140, 147, 186, 116, 196, 117, 36, 21, - 186, 76, 21, 186, -1, 76, -1, 77, -1, 192, - 136, 184, 114, 21, 186, -1, 136, 184, 114, 21, - 186, -1, 138, 198, -1, 149, 118, 186, 114, 186, - 120, -1, 194, 114, 118, 186, 114, 186, 120, -1, - 187, -1, 195, 114, 187, -1, 195, -1, -1, 60, - 59, -1, 59, -1, 130, 149, 186, 114, 186, -1, - 131, 149, 186, 114, 186, -1, 132, 149, 186, 114, - 186, -1, 49, 187, -1, 133, 187, 114, 187, -1, - 103, 187, 36, 149, -1, 104, 187, 114, 187, 114, - 187, -1, 107, 187, 114, 149, -1, 111, 187, 114, - 149, -1, 112, 187, 114, 149, -1, 108, 187, 114, - 187, -1, 109, 187, 114, 187, 114, 187, -1, 110, - 187, 114, 187, 114, 187, -1, 102, 194, -1, 197, - 140, 147, 186, 116, 196, 117, -1, 201, -1, 114, - 195, -1, -1, 35, -1, -1, 96, 149, 142, -1, - 96, 149, 114, 15, 186, 142, -1, 97, 149, 142, - -1, 97, 149, 114, 15, 186, 142, -1, 98, 187, - -1, 200, 99, 149, 186, -1, 200, 100, 187, 114, - 149, 186, -1, 101, 149, 186, 199, -1 +static const short yyr1[] = { 0, + 127, 127, 128, 128, 129, 129, 129, 129, 129, 129, + 129, 129, 129, 130, 130, 130, 131, 131, 131, 131, + 131, 131, 132, 132, 133, 133, 133, 133, 134, 134, + 134, 134, 135, 135, 136, 136, 137, 137, 138, 138, + 138, 138, 138, 138, 138, 138, 139, 139, 139, 139, + 139, 139, 139, 139, 140, 140, 141, 141, 142, 143, + 143, 144, 144, 145, 145, 146, 146, 147, 147, 148, + 149, 149, 149, 149, 149, 149, 149, 149, 149, 149, + 149, 149, 149, 150, 150, 150, 150, 150, 150, 150, + 150, 150, 150, 151, 151, 152, 152, 152, 152, 153, + 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, + 153, 153, 153, 153, 153, 154, 154, 154, 154, 154, + 154, 154, 154, 154, 154, 155, 155, 156, 156, 157, + 158, 158, 158, 158, 158, 159, 159, 159, 160, 159, + 161, 159, 162, 159, 163, 159, 159, 159, 159, 164, + 165, 165, 166, 166, 166, 166, 167, 168, 168, 168, + 169, 169, 170, 170, 171, 172, 172, 173, 173, 173, + 173, 174, 175, 175, 176, 177, 177, 178, 179, 179, + 179, 181, 180, 182, 182, 183, 183, 183, 183, 183, + 183, 183, 183, 183, 183, 183, 184, 184, 185, 185, + 186, 187, 187, 188, 189, 189, 189, 190, 190, 190, + 190, 190, 190, 190, 190, 190, 191, 191, 192, 193, + 193, 194, 194, 195, 195, 196, 196, 197, 197, 197, + 197, 197, 197, 197, 197, 197, 197, 197, 197, 197, + 197, 197, 197, 198, 198, 199, 199, 200, 200, 200, + 200, 200, 200, 200, 200 }; -/* YYRLINE[YYN] -- source line where rule number YYN was defined. */ -static const unsigned short int yyrline[] = -{ - 0, 1139, 1139, 1140, 1148, 1149, 1159, 1159, 1159, 1159, - 1159, 1159, 1159, 1159, 1159, 1160, 1160, 1160, 1161, 1161, - 1161, 1161, 1161, 1161, 1163, 1163, 1167, 1167, 1167, 1167, - 1168, 1168, 1168, 1168, 1169, 1169, 1170, 1170, 1173, 1177, - 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1191, 1192, - 1193, 1194, 1195, 1196, 1197, 1198, 1207, 1208, 1214, 1215, - 1223, 1231, 1232, 1237, 1238, 1239, 1244, 1258, 1258, 1259, - 1259, 1261, 1271, 1271, 1271, 1271, 1271, 1271, 1271, 1272, - 1272, 1272, 1272, 1272, 1272, 1273, 1277, 1281, 1289, 1297, - 1310, 1315, 1327, 1337, 1341, 1352, 1357, 1363, 1364, 1368, - 1372, 1383, 1409, 1423, 1453, 1479, 1500, 1513, 1523, 1528, - 1589, 1596, 1605, 1611, 1617, 1621, 1625, 1633, 1644, 1676, - 1684, 1711, 1722, 1728, 1736, 1742, 1748, 1757, 1761, 1769, - 1769, 1779, 1787, 1792, 1796, 1800, 1804, 1819, 1841, 1844, - 1847, 1847, 1855, 1855, 1863, 1863, 1871, 1871, 1880, 1883, - 1886, 1890, 1903, 1904, 1906, 1910, 1919, 1923, 1928, 1930, - 1935, 1940, 1949, 1949, 1950, 1950, 1952, 1959, 1965, 1972, - 1976, 1982, 1987, 1992, 2087, 2087, 2089, 2097, 2097, 2099, - 2104, 2105, 2106, 2108, 2108, 2118, 2122, 2127, 2131, 2135, - 2139, 2143, 2147, 2151, 2155, 2159, 2184, 2188, 2202, 2206, - 2212, 2212, 2218, 2223, 2227, 2236, 2247, 2252, 2264, 2277, - 2281, 2285, 2290, 2299, 2318, 2327, 2383, 2387, 2394, 2405, - 2418, 2427, 2436, 2446, 2450, 2457, 2457, 2459, 2463, 2468, - 2490, 2505, 2519, 2532, 2540, 2548, 2556, 2562, 2582, 2605, - 2611, 2617, 2623, 2638, 2697, 2704, 2707, 2712, 2716, 2723, - 2728, 2734, 2739, 2745, 2753, 2765, 2780 +static const short yyr2[] = { 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, 2, 0, 1, 1, + 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, + 1, 1, 1, 2, 0, 2, 0, 3, 2, 0, + 1, 0, 3, 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, 6, 8, 8, 3, 1, 1, 1, 1, + 2, 2, 4, 2, 1, 4, 2, 4, 0, 7, + 0, 7, 0, 7, 0, 7, 3, 4, 0, 1, + 1, 1, 3, 3, 3, 3, 3, 3, 1, 0, + 1, 1, 1, 0, 2, 3, 1, 1, 3, 1, + 0, 8, 1, 1, 3, 1, 1, 2, 0, 1, + 1, 0, 4, 0, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 3, 1, 5, 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, 4, 6, 6, + 2, 7, 1, 2, 0, 1, 0, 3, 6, 3, + 6, 2, 4, 6, 4 }; -#endif -#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE -/* YYTNAME[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", "SECTION", "VOLATILE", "TO", - "DOTDOTDOT", "NULL_TOK", "UNDEF", "CONST", "INTERNAL", "LINKONCE", - "WEAK", "APPENDING", "DLLIMPORT", "DLLEXPORT", "EXTERN_WEAK", "OPAQUE", - "NOT", "EXTERNAL", "TARGET", "TRIPLE", "ENDIAN", "POINTERSIZE", "LITTLE", - "BIG", "ALIGN", "DEPLIBS", "CALL", "TAIL", "ASM_TOK", "MODULE", - "SIDEEFFECT", "CC_TOK", "CCC_TOK", "CSRETCC_TOK", "FASTCC_TOK", - "COLDCC_TOK", "X86_STDCALLCC_TOK", "X86_FASTCALLCC_TOK", "DATALAYOUT", - "RET", "BR", "SWITCH", "INVOKE", "UNWIND", "UNREACHABLE", "ADD", "SUB", - "MUL", "UDIV", "SDIV", "FDIV", "UREM", "SREM", "FREM", "AND", "OR", - "XOR", "SETLE", "SETGE", "SETLT", "SETGT", "SETEQ", "SETNE", "MALLOC", - "ALLOCA", "FREE", "LOAD", "STORE", "GETELEMENTPTR", "PHI_TOK", "CAST", - "SELECT", "SHL", "SHR", "VAARG", "EXTRACTELEMENT", "INSERTELEMENT", - "SHUFFLEVECTOR", "VAARG_old", "VANEXT_old", "'='", "','", "'\\\\'", - "'('", "')'", "'['", "'x'", "']'", "'<'", "'>'", "'{'", "'}'", "'*'", - "'c'", "$accept", "INTVAL", "EINT64VAL", "ArithmeticOps", "LogicalOps", - "SetCondOps", "ShiftOps", "SIntType", "UIntType", "IntType", "FPType", - "OptAssign", "OptLinkage", "OptCallingConv", "OptAlign", "OptCAlign", - "SectionString", "OptSection", "GlobalVarAttributes", - "GlobalVarAttribute", "TypesV", "UpRTypesV", "Types", "PrimType", - "UpRTypes", "TypeListI", "ArgTypeListI", "ConstVal", "ConstExpr", - "ConstVector", "GlobalType", "Module", "FunctionList", "ConstPool", "@1", - "@2", "@3", "@4", "AsmBlock", "BigOrLittle", "TargetDefinition", - "LibrariesDefinition", "LibList", "Name", "OptName", "ArgVal", - "ArgListH", "ArgList", "FunctionHeaderH", "BEGIN", "FunctionHeader", - "END", "Function", "FnDeclareLinkage", "FunctionProto", "@5", - "OptSideEffect", "ConstValueRef", "SymbolicValueRef", "ValueRef", - "ResolvedVal", "BasicBlockList", "BasicBlock", "InstructionList", - "BBTerminatorInst", "JumpTable", "Inst", "PHIList", "ValueRefList", - "ValueRefListE", "OptTailCall", "InstVal", "IndexList", "OptVolatile", - "MemoryInst", 0 +static const short yydefact[] = { 149, + 46, 135, 134, 182, 39, 40, 41, 42, 43, 44, + 45, 0, 47, 206, 131, 132, 206, 161, 162, 0, + 0, 0, 46, 0, 137, 179, 0, 0, 48, 49, + 50, 51, 52, 53, 0, 0, 207, 203, 38, 176, + 177, 178, 202, 0, 0, 0, 0, 147, 0, 0, + 0, 0, 0, 0, 0, 37, 180, 181, 47, 150, + 133, 54, 1, 2, 67, 71, 72, 73, 74, 75, + 76, 77, 78, 79, 80, 81, 82, 83, 84, 0, + 0, 0, 0, 197, 0, 0, 66, 85, 70, 198, + 86, 173, 174, 175, 247, 205, 0, 0, 0, 0, + 160, 148, 138, 136, 128, 129, 0, 0, 0, 0, + 183, 87, 0, 0, 69, 92, 94, 0, 0, 99, + 93, 246, 0, 227, 0, 0, 0, 0, 47, 215, + 216, 5, 6, 7, 8, 9, 10, 11, 12, 13, + 14, 15, 16, 17, 18, 19, 20, 21, 22, 0, + 0, 0, 0, 0, 0, 0, 23, 24, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 204, 47, + 219, 0, 243, 155, 152, 151, 153, 154, 156, 159, + 0, 143, 145, 141, 71, 72, 73, 74, 75, 76, + 77, 78, 79, 80, 81, 0, 0, 0, 0, 139, + 0, 0, 0, 91, 171, 98, 96, 0, 0, 231, + 226, 209, 208, 0, 0, 28, 32, 27, 31, 26, + 30, 25, 29, 33, 34, 0, 0, 57, 57, 252, + 0, 0, 241, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 157, + 62, 62, 62, 113, 114, 3, 4, 111, 112, 115, + 110, 106, 107, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 109, 108, 62, + 68, 68, 95, 170, 164, 167, 168, 0, 0, 88, + 186, 187, 188, 193, 189, 190, 191, 192, 184, 0, + 195, 200, 199, 201, 0, 210, 0, 0, 0, 248, + 0, 250, 245, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 158, 0, 144, 146, 142, 0, 0, 0, 0, 0, + 0, 101, 127, 0, 0, 105, 0, 102, 0, 0, + 0, 0, 140, 89, 90, 163, 165, 0, 60, 97, + 185, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 255, 0, 0, 233, 0, 235, 238, 0, 0, 236, + 237, 0, 0, 0, 232, 0, 253, 0, 0, 0, + 64, 62, 245, 0, 0, 0, 0, 0, 0, 100, + 103, 104, 0, 0, 0, 0, 169, 166, 61, 55, + 0, 194, 0, 0, 225, 57, 58, 57, 222, 244, + 0, 0, 0, 0, 0, 228, 229, 230, 225, 0, + 59, 65, 63, 0, 0, 0, 0, 0, 0, 126, + 0, 0, 0, 0, 0, 172, 0, 0, 0, 224, + 0, 0, 249, 251, 0, 0, 0, 234, 239, 240, + 0, 254, 117, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 56, 196, 0, 0, 0, 223, 220, 0, + 242, 116, 0, 123, 0, 0, 119, 120, 121, 122, + 0, 213, 0, 0, 0, 221, 0, 0, 0, 211, + 0, 212, 0, 0, 118, 124, 125, 0, 0, 0, + 0, 0, 0, 218, 0, 0, 217, 214, 0, 0, + 0 }; -#endif -# ifdef YYPRINT -/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to - token YYLEX-NUM. */ -static const unsigned short int 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, 349, 350, 351, 352, 353, 354, - 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, - 365, 366, 367, 61, 44, 92, 40, 41, 91, 120, - 93, 60, 62, 123, 125, 42, 99 -}; -# endif - -/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ -static const unsigned char yyr1[] = -{ - 0, 127, 128, 128, 129, 129, 130, 130, 130, 130, - 130, 130, 130, 130, 130, 131, 131, 131, 132, 132, - 132, 132, 132, 132, 133, 133, 134, 134, 134, 134, - 135, 135, 135, 135, 136, 136, 137, 137, 138, 138, - 139, 139, 139, 139, 139, 139, 139, 139, 140, 140, - 140, 140, 140, 140, 140, 140, 141, 141, 142, 142, - 143, 144, 144, 145, 145, 146, 146, 147, 147, 148, - 148, 149, 150, 150, 150, 150, 150, 150, 150, 150, - 150, 150, 150, 150, 150, 151, 151, 151, 151, 151, - 151, 151, 151, 151, 151, 152, 152, 153, 153, 153, - 153, 154, 154, 154, 154, 154, 154, 154, 154, 154, - 154, 154, 154, 154, 154, 154, 154, 155, 155, 155, - 155, 155, 155, 155, 155, 155, 155, 156, 156, 157, - 157, 158, 159, 159, 159, 159, 159, 160, 160, 160, - 161, 160, 162, 160, 163, 160, 164, 160, 160, 160, - 160, 165, 166, 166, 167, 167, 167, 167, 168, 169, - 169, 169, 170, 170, 171, 171, 172, 173, 173, 174, - 174, 174, 174, 175, 176, 176, 177, 178, 178, 179, - 180, 180, 180, 182, 181, 183, 183, 184, 184, 184, - 184, 184, 184, 184, 184, 184, 184, 184, 185, 185, - 186, 186, 187, 188, 188, 189, 190, 190, 190, 191, - 191, 191, 191, 191, 191, 191, 191, 191, 192, 192, - 193, 194, 194, 195, 195, 196, 196, 197, 197, 198, - 198, 198, 198, 198, 198, 198, 198, 198, 198, 198, - 198, 198, 198, 198, 198, 199, 199, 200, 200, 201, - 201, 201, 201, 201, 201, 201, 201 +static const short yydefgoto[] = { 84, + 258, 274, 275, 276, 277, 196, 197, 226, 198, 23, + 13, 35, 446, 310, 391, 410, 333, 392, 85, 86, + 199, 88, 89, 118, 208, 343, 301, 344, 107, 519, + 1, 2, 280, 253, 251, 252, 61, 177, 48, 102, + 181, 90, 357, 286, 287, 288, 36, 94, 14, 42, + 15, 59, 16, 26, 362, 302, 91, 304, 419, 17, + 38, 39, 169, 494, 96, 233, 450, 451, 170, 171, + 371, 172, 173 }; -/* 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, 1, 1, 1, 1, 2, 0, - 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, - 1, 1, 1, 1, 1, 2, 0, 2, 0, 3, - 2, 0, 1, 0, 3, 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, 6, 8, 8, 3, 1, 1, - 1, 1, 2, 2, 4, 2, 1, 4, 2, 4, - 0, 7, 0, 7, 0, 7, 0, 7, 3, 4, - 0, 1, 1, 1, 3, 3, 3, 3, 3, 3, - 1, 0, 1, 1, 1, 0, 2, 3, 1, 1, - 3, 1, 0, 8, 1, 1, 3, 1, 1, 2, - 0, 1, 1, 0, 4, 0, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 3, 1, 5, 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, 4, - 6, 6, 2, 7, 1, 2, 0, 1, 0, 3, - 6, 3, 6, 2, 4, 6, 4 +static const short yypact[] = {-32768, + 184, 610,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, +-32768, -46, 135, -1,-32768,-32768, -18,-32768,-32768, 15, + -72, -24, 51, -62,-32768, 19, 61, 98,-32768,-32768, +-32768,-32768,-32768,-32768, 1070, -20,-32768,-32768, 85,-32768, +-32768,-32768,-32768, 33, 56, 60, 62,-32768, 54, 61, + 1070, 90, 90, 90, 90,-32768,-32768,-32768, 135,-32768, +-32768,-32768,-32768,-32768, 58,-32768,-32768,-32768,-32768,-32768, +-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 173, + 174, 176, 576,-32768, 85, 66,-32768,-32768, -26,-32768, +-32768,-32768,-32768,-32768, 1245,-32768, 157, 83, 179, 162, + 166,-32768,-32768,-32768,-32768,-32768, 1111, 1111, 1111, 1152, +-32768,-32768, 75, 76,-32768,-32768, -26, -78, 80, 865, +-32768,-32768, 1111,-32768, 138, 1193, 24, 151, 135,-32768, +-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, +-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 1111, + 1111, 1111, 1111, 1111, 1111, 1111,-32768,-32768, 1111, 1111, + 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111,-32768, 135, +-32768, 41,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, + -10,-32768,-32768,-32768, 115, 145, 202, 147, 203, 149, + 204, 152, 206, 212, 213, 154, 217, 215, 419,-32768, + 1111, 1111, 1111,-32768, 906,-32768, 118, 116, 643,-32768, +-32768, 58,-32768, 643, 643,-32768,-32768,-32768,-32768,-32768, +-32768,-32768,-32768,-32768,-32768, 643, 1070, 120, 121,-32768, + 643, 124, 129, 208, 131, 133, 134, 140, 141, 142, + 143, 643, 643, 643, 144, 1070, 1111, 1111, 236,-32768, + 148, 148, 148,-32768,-32768,-32768,-32768,-32768,-32768,-32768, +-32768,-32768,-32768, 150, 153, 155, 156, 159, 160, 947, + 1152, 596, 237, 161, 164, 175, 177,-32768,-32768, 148, + -81, -38, -26,-32768, 85,-32768, 180, 146, 988,-32768, +-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 201, 1152, +-32768,-32768,-32768,-32768, 182,-32768, 183, 643, -2,-32768, + 6,-32768, 186, 643, 185, 1111, 1111, 1111, 1111, 1111, + 1111, 1111, 1111, 187, 188, 190, 1111, 643, 643, 191, +-32768, -23,-32768,-32768,-32768, 1152, 1152, 1152, 1152, 1152, + 1152,-32768,-32768, -9, -52,-32768, -76,-32768, 1152, 1152, + 1152, 1152,-32768,-32768,-32768,-32768,-32768, 1029, 231,-32768, +-32768, 243, -14, 247, 249, 193, 643, 294, 643, 1111, +-32768, 196, 643,-32768, 197,-32768,-32768, 199, 205,-32768, +-32768, 643, 643, 643,-32768, 200,-32768, 1111, 291, 313, +-32768, 148, 186, 288, 211, 216, 218, 219, 1152,-32768, +-32768,-32768, 220, 226, 232, 233,-32768,-32768,-32768, 269, + 234,-32768, 643, 643, 1111, 240,-32768, 240,-32768, 241, + 643, 242, 1111, 1111, 1111,-32768,-32768,-32768, 1111, 643, +-32768,-32768,-32768, 214, 1111, 1152, 1152, 1152, 1152,-32768, + 1152, 1152, 1152, 1152, 341,-32768, 327, 246, 239, 241, + 244, 305,-32768,-32768, 1111, 245, 643,-32768,-32768,-32768, + 252,-32768,-32768, 253, 250, 254, 259, 260, 262, 264, + 265, 267,-32768,-32768, 342, 14, 340,-32768,-32768, 257, +-32768,-32768, 1152,-32768, 1152, 1152,-32768,-32768,-32768,-32768, + 643,-32768, 751, 65, 366,-32768, 274, 278, 279,-32768, + 283,-32768, 751, 643,-32768,-32768,-32768, 377, 285, 325, + 643, 382, 383,-32768, 643, 643,-32768,-32768, 405, 406, +-32768 }; -/* 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 short int yydefact[] = -{ - 150, 0, 47, 136, 1, 135, 183, 40, 41, 42, - 43, 44, 45, 46, 0, 48, 207, 132, 133, 207, - 162, 163, 0, 0, 0, 47, 0, 138, 180, 0, - 0, 49, 50, 51, 52, 53, 54, 0, 0, 208, - 204, 39, 177, 178, 179, 203, 0, 0, 0, 0, - 148, 0, 0, 0, 0, 0, 0, 0, 38, 181, - 182, 48, 151, 134, 55, 2, 3, 68, 72, 73, - 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, - 84, 85, 0, 0, 0, 0, 198, 0, 0, 67, - 86, 71, 199, 87, 174, 175, 176, 248, 206, 0, - 0, 0, 0, 161, 149, 139, 137, 129, 130, 0, - 0, 0, 0, 184, 88, 0, 0, 70, 93, 95, - 0, 0, 100, 94, 247, 0, 228, 0, 0, 0, - 0, 48, 216, 217, 6, 7, 8, 9, 10, 11, - 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, - 22, 23, 0, 0, 0, 0, 0, 0, 0, 24, - 25, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 205, 48, 220, 0, 244, 156, 153, 152, 154, - 155, 157, 160, 0, 144, 146, 142, 72, 73, 74, - 75, 76, 77, 78, 79, 80, 81, 82, 0, 0, - 0, 0, 140, 0, 0, 0, 92, 172, 99, 97, - 0, 0, 232, 227, 210, 209, 0, 0, 29, 33, - 28, 32, 27, 31, 26, 30, 34, 35, 0, 0, - 58, 58, 253, 0, 0, 242, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 158, 63, 63, 63, 114, 115, 4, 5, - 112, 113, 116, 111, 107, 108, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 110, 109, 63, 69, 69, 96, 171, 165, 168, 169, - 0, 0, 89, 187, 188, 189, 194, 190, 191, 192, - 193, 185, 0, 196, 201, 200, 202, 0, 211, 0, - 0, 0, 249, 0, 251, 246, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 159, 0, 145, 147, 143, 0, 0, - 0, 0, 0, 0, 102, 128, 0, 0, 106, 0, - 103, 0, 0, 0, 0, 141, 90, 91, 164, 166, - 0, 61, 98, 186, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 256, 0, 0, 234, 0, 236, 239, - 0, 0, 237, 238, 0, 0, 0, 233, 0, 254, - 0, 0, 0, 65, 63, 246, 0, 0, 0, 0, - 0, 0, 101, 104, 105, 0, 0, 0, 0, 170, - 167, 62, 56, 0, 195, 0, 0, 226, 58, 59, - 58, 223, 245, 0, 0, 0, 0, 0, 229, 230, - 231, 226, 0, 60, 66, 64, 0, 0, 0, 0, - 0, 0, 127, 0, 0, 0, 0, 0, 173, 0, - 0, 0, 225, 0, 0, 250, 252, 0, 0, 0, - 235, 240, 241, 0, 255, 118, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 57, 197, 0, 0, 0, - 224, 221, 0, 243, 117, 0, 124, 0, 0, 120, - 121, 122, 123, 0, 214, 0, 0, 0, 222, 0, - 0, 0, 212, 0, 213, 0, 0, 119, 125, 126, - 0, 0, 0, 0, 0, 0, 219, 0, 0, 218, - 215 +static const short yypgoto[] = {-32768, +-32768, 312, 314, 315, 316, -127, -126, -462,-32768, 369, + 389, -87,-32768, -225, 55,-32768, -245,-32768, -48,-32768, + -35,-32768, -66, 293,-32768, -100, 222, -253, 59,-32768, +-32768,-32768,-32768,-32768,-32768,-32768, 365,-32768,-32768,-32768, +-32768, 4,-32768, 68,-32768,-32768, 357,-32768,-32768,-32768, +-32768,-32768, 415,-32768,-32768, -453, -55, 64, -103,-32768, + 401,-32768,-32768,-32768,-32768,-32768, 49, -7,-32768,-32768, + 30,-32768,-32768 }; -/* YYDEFGOTO[NTERM-NUM]. */ -static const short int yydefgoto[] = -{ - -1, 86, 260, 276, 277, 278, 279, 198, 199, 228, - 200, 25, 15, 37, 448, 312, 393, 412, 335, 394, - 87, 88, 201, 90, 91, 120, 210, 345, 303, 346, - 109, 1, 2, 3, 282, 255, 253, 254, 63, 179, - 50, 104, 183, 92, 359, 288, 289, 290, 38, 96, - 16, 44, 17, 61, 18, 28, 364, 304, 93, 306, - 421, 19, 40, 41, 171, 496, 98, 235, 452, 453, - 172, 173, 373, 174, 175 -}; -/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing - STATE-NUM. */ -#define YYPACT_NINF -447 -static const short int yypact[] = -{ - -447, 33, 122, 610, -447, -447, -447, -447, -447, -447, - -447, -447, -447, -447, -13, 161, 47, -447, -447, -15, - -447, -447, 15, 10, 91, -6, 48, -447, 19, 138, - 168, -447, -447, -447, -447, -447, -447, 1070, -20, -447, - -447, 70, -447, -447, -447, -447, 60, 61, 64, 67, - -447, 63, 138, 1070, 106, 106, 106, 106, -447, -447, - -447, 161, -447, -447, -447, -447, -447, 59, -447, -447, - -447, -447, -447, -447, -447, -447, -447, -447, -447, -447, - -447, -447, 174, 178, 179, 576, -447, 70, 74, -447, - -447, -54, -447, -447, -447, -447, -447, 1245, -447, 162, - -44, 190, 171, 172, -447, -447, -447, -447, -447, 1111, - 1111, 1111, 1152, -447, -447, 78, 88, -447, -447, -54, - -29, 92, 865, -447, -447, 1111, -447, 150, 1193, 75, - 189, 161, -447, -447, -447, -447, -447, -447, -447, -447, - -447, -447, -447, -447, -447, -447, -447, -447, -447, -447, - -447, -447, 1111, 1111, 1111, 1111, 1111, 1111, 1111, -447, - -447, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111, - 1111, -447, 161, -447, 8, -447, -447, -447, -447, -447, - -447, -447, -447, -10, -447, -447, -447, 113, 139, 206, - 145, 211, 147, 215, 152, 216, 214, 225, 154, 218, - 226, 419, -447, 1111, 1111, 1111, -447, 906, -447, 120, - 118, 643, -447, -447, 59, -447, 643, 643, -447, -447, - -447, -447, -447, -447, -447, -447, -447, -447, 643, 1070, - 128, 129, -447, 643, 126, 131, 210, 133, 134, 140, - 141, 142, 143, 144, 643, 643, 643, 146, 1070, 1111, - 1111, 237, -447, 148, 148, 148, -447, -447, -447, -447, - -447, -447, -447, -447, -447, -447, 149, 151, 153, 155, - 156, 159, 947, 1152, 596, 239, 160, 164, 175, 177, - -447, -447, 148, -74, -23, -54, -447, 70, -447, 163, - 180, 988, -447, -447, -447, -447, -447, -447, -447, -447, - -447, 201, 1152, -447, -447, -447, -447, 182, -447, 184, - 643, -2, -447, 6, -447, 186, 643, 176, 1111, 1111, - 1111, 1111, 1111, 1111, 1111, 1111, 187, 188, 191, 1111, - 643, 643, 195, -447, -12, -447, -447, -447, 1152, 1152, - 1152, 1152, 1152, 1152, -447, -447, -9, -21, -447, -27, - -447, 1152, 1152, 1152, 1152, -447, -447, -447, -447, -447, - 1029, 232, -447, -447, 244, -16, 249, 282, 194, 643, - 300, 643, 1111, -447, 197, 643, -447, 199, -447, -447, - 202, 203, -447, -447, 643, 643, 643, -447, 208, -447, - 1111, 291, 315, -447, 148, 186, 289, 212, 217, 219, - 220, 1152, -447, -447, -447, 231, 233, 234, 240, -447, - -447, -447, 273, 241, -447, 643, 643, 1111, 242, -447, - 242, -447, 243, 643, 246, 1111, 1111, 1111, -447, -447, - -447, 1111, 643, -447, -447, -447, 223, 1111, 1152, 1152, - 1152, 1152, -447, 1152, 1152, 1152, 1152, 328, -447, 322, - 247, 245, 243, 248, 294, -447, -447, 1111, 250, 643, - -447, -447, -447, 252, -447, -447, 254, 259, 257, 262, - 263, 264, 265, 267, 270, -447, -447, 341, 14, 343, - -447, -447, 271, -447, -447, 1152, -447, 1152, 1152, -447, - -447, -447, -447, 643, -447, 751, 65, 374, -447, 279, - 280, 281, -447, 285, -447, 751, 643, -447, -447, -447, - 380, 290, 288, 643, 382, 384, -447, 643, 643, -447, - -447 +#define YYLAST 1357 + + +static const short yytable[] = { 87, + 224, 225, 104, 312, 37, 24, 334, 335, 92, 200, + 389, 40, 367, 493, 27, 87, 117, 345, 347, 210, + 369, 37, 213, 216, 217, 218, 219, 220, 221, 222, + 223, 503, 214, 390, 353, 203, 50, 399, 354, 501, + 49, 227, 24, 121, 215, 204, 363, 402, 230, 509, + 56, 234, 235, 117, 368, 236, 237, 238, 239, 240, + 241, 399, 368, 57, 245, 58, 44, 45, 46, 401, + 51, 182, 183, 184, 216, 217, 218, 219, 220, 221, + 222, 223, 246, 355, 60, 47, 121, 209, 119, -68, + 209, 5, 6, 7, 8, 52, 10, 53, 121, 399, + 54, 62, 93, 249, 399, 41, 18, 412, 19, 250, + 400, 108, 109, 110, 228, 229, 209, 231, 232, 209, + 209, 105, 106, 209, 209, 209, 209, 209, 209, 242, + 243, 244, 209, 492, 281, 282, 283, 175, 176, 247, + 248, 254, 255, 279, 330, 97, 433, -28, -28, -27, + -27, -26, -26, 303, -25, -25, 256, 257, 303, 303, + 216, 217, 218, 219, 220, 221, 222, 223, 98, 285, + 303, 101, 99, -69, 100, 303, 112, 113, 308, 114, + 174, 120, 178, -130, 502, 179, 303, 303, 303, 180, + 453, 87, 454, 201, 202, 205, 211, 328, 28, 29, + 30, 31, 32, 33, 34, -32, -31, -30, 3, -29, + 87, 329, 209, 375, 4, 377, 378, 379, -35, -36, + 259, 260, 283, 385, 5, 6, 7, 8, 9, 10, + 11, 289, 290, 309, 311, 393, 394, 395, 396, 397, + 398, 314, 315, 316, 317, 12, 318, 319, 403, 404, + 405, 406, 303, 320, 321, 322, 323, 327, 303, 331, + 348, 332, 359, 361, 389, 336, 411, 413, 337, 414, + 338, 339, 303, 303, 340, 341, 349, 305, 306, 350, + 374, 209, 376, 209, 209, 209, 380, 381, 356, 307, + 351, 209, 352, 358, 313, 364, 365, 417, 440, 370, + 382, 383, 373, 384, 388, 324, 325, 326, 415, 421, + 423, 303, 424, 303, 431, 429, 432, 303, 425, 458, + 459, 460, 285, 435, 436, 445, 303, 303, 303, 437, + 463, 438, 439, 441, 209, 465, 466, 467, 468, 442, + 469, 470, 471, 472, 473, 443, 444, 447, 224, 225, + 474, 478, 430, 452, 455, 457, 476, 303, 303, 475, + 477, 368, 491, 483, 479, 303, 224, 225, 481, 482, + 484, 366, 485, 486, 303, 495, 496, 372, 487, 209, + 488, 489, 497, 490, 498, 499, 504, 209, 209, 209, + 505, 386, 387, 209, 506, 507, 508, 511, 512, 464, + 513, 303, 515, 516, 520, 521, 165, 95, 166, 167, + 168, 55, 207, 409, 103, 111, 25, 43, 420, 209, + 278, 461, 434, 63, 64, 408, 0, 0, 0, 0, + 416, 0, 418, 0, 0, 303, 422, 0, 0, 0, + 18, 0, 19, 0, 261, 426, 427, 428, 303, 0, + 0, 0, 0, 0, 0, 303, 262, 263, 0, 303, + 303, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 448, 449, 0, 0, + 0, 0, 0, 0, 456, 0, 0, 0, 0, 0, + 0, 0, 0, 462, 0, 0, 132, 133, 134, 135, + 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, + 146, 147, 148, 149, 0, 0, 0, 0, 0, 264, + 480, 265, 266, 157, 158, 0, 267, 268, 269, 0, + 0, 0, 0, 0, 0, 0, 270, 0, 0, 271, + 0, 272, 0, 0, 273, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 500, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 510, 0, 0, + 0, 0, 0, 0, 514, 0, 0, 0, 517, 518, + 63, 64, 0, 115, 66, 67, 68, 69, 70, 71, + 72, 73, 74, 75, 76, 77, 78, 18, 0, 19, + 63, 64, 0, 115, 185, 186, 187, 188, 189, 190, + 191, 192, 193, 194, 195, 77, 78, 18, 0, 19, + 0, 0, 0, 79, 0, 0, 0, 0, 0, -38, + 0, 18, 0, 19, 0, 0, 0, 0, 0, 0, + 4, -38, -38, 79, 0, 291, 292, 63, 64, 293, + -38, -38, -38, -38, -38, -38, -38, 0, 0, -38, + 20, 0, 0, 0, 18, 0, 19, 21, 294, 295, + 296, 22, 0, 0, 0, 0, 0, 0, 0, 0, + 297, 298, 0, 0, 0, 0, 0, 0, 0, 0, + 80, 0, 0, 81, 0, 0, 82, 0, 83, 116, + 0, 0, 0, 299, 0, 0, 0, 0, 0, 0, + 80, 0, 0, 81, 0, 0, 82, 0, 83, 346, + 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, + 142, 143, 144, 145, 146, 147, 148, 149, 0, 0, + 0, 0, 0, 264, 0, 265, 266, 157, 158, 0, + 267, 268, 269, 291, 292, 0, 0, 293, 0, 0, + 0, 0, 0, 300, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 294, 295, 296, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 297, 298, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 299, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 132, 133, + 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, + 144, 145, 146, 147, 148, 149, 0, 0, 0, 0, + 0, 264, 0, 265, 266, 157, 158, 0, 267, 268, + 269, 0, 0, 0, 0, 0, 0, 0, 0, 63, + 64, 300, 115, 66, 67, 68, 69, 70, 71, 72, + 73, 74, 75, 76, 77, 78, 18, 0, 19, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 206, 0, 0, 0, 0, 0, 0, 0, 0, + 63, 64, 79, 115, 66, 67, 68, 69, 70, 71, + 72, 73, 74, 75, 76, 77, 78, 18, 0, 19, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 284, 0, 0, 0, 0, 0, 0, 0, + 0, 63, 64, 79, 115, 185, 186, 187, 188, 189, + 190, 191, 192, 193, 194, 195, 77, 78, 18, 0, + 19, 0, 0, 0, 0, 0, 0, 0, 0, 80, + 0, 0, 81, 0, 0, 82, 0, 83, 0, 0, + 0, 0, 63, 64, 79, 115, 66, 67, 68, 69, + 70, 71, 72, 73, 74, 75, 76, 77, 78, 18, + 0, 19, 0, 0, 0, 0, 0, 0, 0, 0, + 80, 0, 0, 81, 360, 0, 82, 0, 83, 0, + 0, 0, 0, 63, 64, 79, 115, 66, 67, 68, + 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, + 18, 0, 19, 0, 0, 0, 0, 0, 0, 0, + 0, 80, 0, 0, 81, 407, 342, 82, 0, 83, + 0, 0, 0, 0, 63, 64, 79, 65, 66, 67, + 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, + 78, 18, 0, 19, 0, 0, 0, 0, 0, 0, + 0, 0, 80, 0, 0, 81, 0, 0, 82, 0, + 83, 0, 0, 0, 0, 63, 64, 79, 115, 66, + 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, + 77, 78, 18, 0, 19, 0, 0, 0, 0, 0, + 0, 0, 0, 80, 0, 0, 81, 0, 0, 82, + 0, 83, 0, 0, 0, 0, 63, 64, 79, 115, + 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, + 195, 77, 78, 18, 0, 19, 0, 0, 0, 0, + 0, 0, 0, 0, 80, 0, 0, 81, 0, 0, + 82, 0, 83, 0, 0, 0, 0, 63, 64, 79, + 212, 66, 67, 68, 69, 70, 71, 72, 73, 74, + 75, 76, 77, 78, 18, 0, 19, 0, 0, 0, + 0, 0, 0, 0, 0, 80, 0, 0, 81, 0, + 0, 82, 0, 83, 0, 0, 0, 0, 0, 0, + 79, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 80, 0, 0, 81, + 0, 0, 82, 0, 83, 0, 0, 0, 0, 122, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 123, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 124, 125, 0, 0, 80, 0, 0, + 81, 0, 0, 82, 0, 83, 126, 127, 128, 129, + 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, + 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, + 150, 151, 152, 0, 0, 153, 154, 155, 156, 157, + 158, 159, 160, 161, 162, 163, 164 }; -/* YYPGOTO[NTERM-NUM]. */ -static const short int yypgoto[] = -{ - -447, -447, -447, 309, 310, 311, 312, -129, -128, -446, - -447, 369, 386, -89, -447, -227, 51, -447, -248, -447, - -50, -447, -37, -447, -68, 292, -447, -102, 221, -255, - 57, -447, -447, -447, -447, -447, -447, -447, 361, -447, - -447, -447, -447, 2, -447, 55, -447, -447, 355, -447, - -447, -447, -447, -447, 414, -447, -447, -405, -57, 62, - -105, -447, 399, -447, -447, -447, -447, -447, 49, -8, - -447, -447, 24, -447, -447 +static const short yycheck[] = { 35, + 128, 128, 51, 229, 23, 2, 252, 253, 29, 110, + 34, 30, 15, 476, 61, 51, 83, 271, 272, 123, + 15, 23, 126, 10, 11, 12, 13, 14, 15, 16, + 17, 494, 9, 57, 280, 114, 61, 114, 120, 493, + 113, 129, 39, 125, 21, 124, 300, 124, 152, 503, + 113, 155, 156, 120, 57, 159, 160, 161, 162, 163, + 164, 114, 57, 45, 168, 47, 52, 53, 54, 122, + 20, 107, 108, 109, 10, 11, 12, 13, 14, 15, + 16, 17, 170, 122, 24, 71, 125, 123, 85, 116, + 126, 41, 42, 43, 44, 45, 46, 47, 125, 114, + 50, 4, 123, 114, 114, 124, 22, 122, 24, 120, + 120, 53, 54, 55, 150, 151, 152, 153, 154, 155, + 156, 32, 33, 159, 160, 161, 162, 163, 164, 165, + 166, 167, 168, 120, 201, 202, 203, 55, 56, 99, + 100, 27, 28, 199, 248, 113, 392, 3, 4, 3, + 4, 3, 4, 209, 3, 4, 3, 4, 214, 215, + 10, 11, 12, 13, 14, 15, 16, 17, 113, 205, + 226, 118, 113, 116, 113, 231, 4, 4, 227, 4, + 24, 116, 4, 0, 120, 24, 242, 243, 244, 24, + 416, 227, 418, 119, 119, 116, 59, 246, 64, 65, + 66, 67, 68, 69, 70, 4, 4, 4, 25, 4, + 246, 247, 248, 317, 31, 319, 320, 321, 7, 7, + 4, 7, 289, 327, 41, 42, 43, 44, 45, 46, + 47, 114, 117, 114, 114, 336, 337, 338, 339, 340, + 341, 118, 114, 36, 114, 62, 114, 114, 349, 350, + 351, 352, 308, 114, 114, 114, 114, 114, 314, 24, + 24, 114, 117, 63, 34, 116, 24, 21, 116, 21, + 116, 116, 328, 329, 116, 116, 116, 214, 215, 116, + 316, 317, 318, 319, 320, 321, 322, 323, 285, 226, + 116, 327, 116, 114, 231, 114, 114, 4, 399, 114, + 114, 114, 118, 114, 114, 242, 243, 244, 116, 114, + 114, 367, 114, 369, 24, 116, 4, 373, 114, 423, + 424, 425, 358, 36, 114, 57, 382, 383, 384, 114, + 117, 114, 114, 114, 370, 436, 437, 438, 439, 114, + 441, 442, 443, 444, 4, 114, 114, 114, 476, 476, + 24, 455, 388, 114, 114, 114, 118, 413, 414, 114, + 117, 57, 21, 114, 120, 421, 494, 494, 117, 117, + 117, 308, 114, 114, 430, 36, 120, 314, 117, 415, + 117, 117, 483, 117, 485, 486, 21, 423, 424, 425, + 117, 328, 329, 429, 117, 117, 114, 21, 114, 435, + 76, 457, 21, 21, 0, 0, 95, 39, 95, 95, + 95, 23, 120, 359, 50, 59, 2, 17, 370, 455, + 199, 429, 393, 5, 6, 358, -1, -1, -1, -1, + 367, -1, 369, -1, -1, 491, 373, -1, -1, -1, + 22, -1, 24, -1, 26, 382, 383, 384, 504, -1, + -1, -1, -1, -1, -1, 511, 38, 39, -1, 515, + 516, -1, -1, -1, -1, -1, -1, -1, -1, -1, + -1, -1, -1, -1, -1, -1, 413, 414, -1, -1, + -1, -1, -1, -1, 421, -1, -1, -1, -1, -1, + -1, -1, -1, 430, -1, -1, 78, 79, 80, 81, + 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, + 92, 93, 94, 95, -1, -1, -1, -1, -1, 101, + 457, 103, 104, 105, 106, -1, 108, 109, 110, -1, + -1, -1, -1, -1, -1, -1, 118, -1, -1, 121, + -1, 123, -1, -1, 126, -1, -1, -1, -1, -1, + -1, -1, -1, -1, 491, -1, -1, -1, -1, -1, + -1, -1, -1, -1, -1, -1, -1, 504, -1, -1, + -1, -1, -1, -1, 511, -1, -1, -1, 515, 516, + 5, 6, -1, 8, 9, 10, 11, 12, 13, 14, + 15, 16, 17, 18, 19, 20, 21, 22, -1, 24, + 5, 6, -1, 8, 9, 10, 11, 12, 13, 14, + 15, 16, 17, 18, 19, 20, 21, 22, -1, 24, + -1, -1, -1, 48, -1, -1, -1, -1, -1, 20, + -1, 22, -1, 24, -1, -1, -1, -1, -1, -1, + 31, 32, 33, 48, -1, 3, 4, 5, 6, 7, + 41, 42, 43, 44, 45, 46, 47, -1, -1, 50, + 51, -1, -1, -1, 22, -1, 24, 58, 26, 27, + 28, 62, -1, -1, -1, -1, -1, -1, -1, -1, + 38, 39, -1, -1, -1, -1, -1, -1, -1, -1, + 115, -1, -1, 118, -1, -1, 121, -1, 123, 124, + -1, -1, -1, 61, -1, -1, -1, -1, -1, -1, + 115, -1, -1, 118, -1, -1, 121, -1, 123, 124, + 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, + 88, 89, 90, 91, 92, 93, 94, 95, -1, -1, + -1, -1, -1, 101, -1, 103, 104, 105, 106, -1, + 108, 109, 110, 3, 4, -1, -1, 7, -1, -1, + -1, -1, -1, 121, -1, -1, -1, -1, -1, -1, + -1, -1, -1, -1, -1, -1, 26, 27, 28, -1, + -1, -1, -1, -1, -1, -1, -1, -1, 38, 39, + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, + -1, 61, -1, -1, -1, -1, -1, -1, -1, -1, + -1, -1, -1, -1, -1, -1, -1, -1, 78, 79, + 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, + 90, 91, 92, 93, 94, 95, -1, -1, -1, -1, + -1, 101, -1, 103, 104, 105, 106, -1, 108, 109, + 110, -1, -1, -1, -1, -1, -1, -1, -1, 5, + 6, 121, 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, + -1, 37, -1, -1, -1, -1, -1, -1, -1, -1, + 5, 6, 48, 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, -1, 37, -1, -1, -1, -1, -1, -1, -1, + -1, 5, 6, 48, 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, 115, + -1, -1, 118, -1, -1, 121, -1, 123, -1, -1, + -1, -1, 5, 6, 48, 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, + 115, -1, -1, 118, 37, -1, 121, -1, 123, -1, + -1, -1, -1, 5, 6, 48, 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, 115, -1, -1, 118, 37, 120, 121, -1, 123, + -1, -1, -1, -1, 5, 6, 48, 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, 115, -1, -1, 118, -1, -1, 121, -1, + 123, -1, -1, -1, -1, 5, 6, 48, 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, 115, -1, -1, 118, -1, -1, 121, + -1, 123, -1, -1, -1, -1, 5, 6, 48, 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, 115, -1, -1, 118, -1, -1, + 121, -1, 123, -1, -1, -1, -1, 5, 6, 48, + 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, 115, -1, -1, 118, -1, + -1, 121, -1, 123, -1, -1, -1, -1, -1, -1, + 48, -1, -1, -1, -1, -1, -1, -1, -1, -1, + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, + -1, -1, -1, -1, -1, -1, 115, -1, -1, 118, + -1, -1, 121, -1, 123, -1, -1, -1, -1, 35, + -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, + -1, -1, -1, 49, -1, -1, -1, -1, -1, -1, + -1, -1, -1, 59, 60, -1, -1, 115, -1, -1, + 118, -1, -1, 121, -1, 123, 72, 73, 74, 75, + 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, + 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, + 96, 97, 98, -1, -1, 101, 102, 103, 104, 105, + 106, 107, 108, 109, 110, 111, 112 }; +/* -*-C-*- Note some compilers choke on comments on `#line' lines. */ +#line 3 "/usr/share/bison.simple" +/* This file comes from bison-1.28. */ -/* 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 -132 -static const short int yytable[] = -{ - 89, 226, 227, 106, 314, 26, 336, 337, 39, 94, - 202, 177, 178, 369, 53, 42, 89, 119, 347, 349, - 212, 371, 391, 215, 218, 219, 220, 221, 222, 223, - 224, 225, 495, 4, 355, 7, 8, 9, 10, 54, - 12, 55, 229, 26, 56, 392, 356, 365, 29, 232, - 505, 123, 236, 237, 119, 370, 238, 239, 240, 241, - 242, 243, -69, 370, 59, 247, 60, 46, 47, 48, - 39, 123, 184, 185, 186, 218, 219, 220, 221, 222, - 223, 224, 225, 248, 216, 205, 49, 401, 211, 121, - 503, 211, 20, 401, 21, 206, 217, 404, 401, 357, - 511, 403, 123, 95, 251, 401, 414, 249, 250, 43, - 252, 402, 110, 111, 112, 230, 231, 211, 233, 234, - 211, 211, -131, 51, 211, 211, 211, 211, 211, 211, - 244, 245, 246, 211, 494, 283, 284, 285, 107, 108, - 256, 257, -29, -29, 281, 332, 435, 5, -28, -28, - -27, -27, 52, 6, 305, -26, -26, 258, 259, 305, - 305, 58, 62, 7, 8, 9, 10, 11, 12, 13, - 287, 305, 64, 99, 100, -70, 305, 101, 114, 310, - 102, 103, 115, 116, 14, 504, 176, 305, 305, 305, - 122, 455, 89, 456, 180, 181, 182, 203, 330, 218, - 219, 220, 221, 222, 223, 224, 225, 204, 207, 213, - -33, 89, 331, 211, 377, -32, 379, 380, 381, -31, - -30, -36, 261, 285, 387, 30, 31, 32, 33, 34, - 35, 36, -37, 262, 291, 292, 395, 396, 397, 398, - 399, 400, 311, 313, 316, 317, 318, 319, 320, 405, - 406, 407, 408, 305, 321, 322, 323, 324, 325, 305, - 329, 333, 334, 350, 363, 338, 391, 339, 413, 340, - 415, 341, 342, 305, 305, 343, 351, 360, 307, 308, - 352, 376, 211, 378, 211, 211, 211, 382, 383, 358, - 309, 353, 211, 354, 375, 315, 366, 361, 367, 442, - 372, 384, 385, 416, 419, 386, 326, 327, 328, 390, - 417, 423, 305, 425, 305, 433, 426, 427, 305, 434, - 460, 461, 462, 287, 431, 437, 438, 305, 305, 305, - 447, 439, 475, 440, 441, 211, 467, 468, 469, 470, - 465, 471, 472, 473, 474, 443, 476, 444, 445, 226, - 227, 370, 480, 432, 446, 449, 454, 457, 305, 305, - 459, 477, 493, 478, 515, 479, 305, 226, 227, 483, - 481, 484, 368, 485, 486, 305, 487, 488, 374, 497, - 211, 489, 490, 499, 491, 500, 501, 492, 211, 211, - 211, 498, 388, 389, 211, 506, 507, 508, 509, 510, - 466, 513, 305, 517, 514, 518, 167, 168, 169, 170, - 97, 57, 411, 105, 209, 410, 113, 27, 45, 436, - 211, 422, 280, 463, 65, 66, 0, 0, 0, 0, - 0, 418, 0, 420, 0, 0, 305, 424, 0, 0, - 0, 20, 0, 21, 0, 263, 428, 429, 430, 305, - 0, 0, 0, 0, 0, 0, 305, 264, 265, 0, - 305, 305, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 450, 451, 0, - 0, 0, 0, 0, 0, 458, 0, 0, 0, 0, - 0, 0, 0, 0, 464, 0, 0, 134, 135, 136, - 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, - 147, 148, 149, 150, 151, 0, 0, 0, 0, 0, - 266, 482, 267, 268, 159, 160, 0, 269, 270, 271, - 0, 0, 0, 0, 0, 0, 0, 272, 0, 0, - 273, 0, 274, 0, 0, 275, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 502, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 512, 0, - 0, 0, 0, 0, 0, 516, 0, 0, 0, 519, - 520, 65, 66, 0, 117, 68, 69, 70, 71, 72, - 73, 74, 75, 76, 77, 78, 79, 80, 20, 0, - 21, 65, 66, 0, 117, 187, 188, 189, 190, 191, - 192, 193, 194, 195, 196, 197, 79, 80, 20, 0, - 21, 0, 0, 0, 81, 0, 0, 0, 0, 0, - -39, 0, 20, 0, 21, 0, 0, 0, 0, 0, - 0, 6, -39, -39, 81, 0, 293, 294, 65, 66, - 295, -39, -39, -39, -39, -39, -39, -39, 0, 0, - -39, 22, 0, 0, 0, 20, 0, 21, 23, 296, - 297, 298, 24, 0, 0, 0, 0, 0, 0, 0, - 0, 299, 300, 0, 0, 0, 0, 0, 0, 0, - 0, 82, 0, 0, 83, 0, 0, 84, 0, 85, - 118, 0, 0, 0, 301, 0, 0, 0, 0, 0, - 0, 82, 0, 0, 83, 0, 0, 84, 0, 85, - 348, 134, 135, 136, 137, 138, 139, 140, 141, 142, - 143, 144, 145, 146, 147, 148, 149, 150, 151, 0, - 0, 0, 0, 0, 266, 0, 267, 268, 159, 160, - 0, 269, 270, 271, 293, 294, 0, 0, 295, 0, - 0, 0, 0, 0, 302, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 296, 297, 298, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 299, - 300, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 301, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 134, - 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, - 145, 146, 147, 148, 149, 150, 151, 0, 0, 0, - 0, 0, 266, 0, 267, 268, 159, 160, 0, 269, - 270, 271, 0, 0, 0, 0, 0, 0, 0, 0, - 65, 66, 302, 117, 68, 69, 70, 71, 72, 73, - 74, 75, 76, 77, 78, 79, 80, 20, 0, 21, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 208, 0, 0, 0, 0, 0, 0, 0, - 0, 65, 66, 81, 117, 68, 69, 70, 71, 72, - 73, 74, 75, 76, 77, 78, 79, 80, 20, 0, - 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 286, 0, 0, 0, 0, 0, 0, - 0, 0, 65, 66, 81, 117, 187, 188, 189, 190, - 191, 192, 193, 194, 195, 196, 197, 79, 80, 20, - 0, 21, 0, 0, 0, 0, 0, 0, 0, 0, - 82, 0, 0, 83, 0, 0, 84, 0, 85, 0, - 0, 0, 0, 65, 66, 81, 117, 68, 69, 70, - 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, - 20, 0, 21, 0, 0, 0, 0, 0, 0, 0, - 0, 82, 0, 0, 83, 362, 0, 84, 0, 85, - 0, 0, 0, 0, 65, 66, 81, 117, 68, 69, - 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, - 80, 20, 0, 21, 0, 0, 0, 0, 0, 0, - 0, 0, 82, 0, 0, 83, 409, 344, 84, 0, - 85, 0, 0, 0, 0, 65, 66, 81, 67, 68, - 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, - 79, 80, 20, 0, 21, 0, 0, 0, 0, 0, - 0, 0, 0, 82, 0, 0, 83, 0, 0, 84, - 0, 85, 0, 0, 0, 0, 65, 66, 81, 117, - 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, - 78, 79, 80, 20, 0, 21, 0, 0, 0, 0, - 0, 0, 0, 0, 82, 0, 0, 83, 0, 0, - 84, 0, 85, 0, 0, 0, 0, 65, 66, 81, - 117, 187, 188, 189, 190, 191, 192, 193, 194, 195, - 196, 197, 79, 80, 20, 0, 21, 0, 0, 0, - 0, 0, 0, 0, 0, 82, 0, 0, 83, 0, - 0, 84, 0, 85, 0, 0, 0, 0, 65, 66, - 81, 214, 68, 69, 70, 71, 72, 73, 74, 75, - 76, 77, 78, 79, 80, 20, 0, 21, 0, 0, - 0, 0, 0, 0, 0, 0, 82, 0, 0, 83, - 0, 0, 84, 0, 85, 0, 0, 0, 0, 0, - 0, 81, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 82, 0, 0, - 83, 0, 0, 84, 0, 85, 0, 0, 0, 0, - 124, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 125, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 126, 127, 0, 0, 82, 0, - 0, 83, 0, 0, 84, 0, 85, 128, 129, 130, - 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, - 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, - 151, 152, 153, 154, 0, 0, 155, 156, 157, 158, - 159, 160, 161, 162, 163, 164, 165, 166 -}; +/* Skeleton output parser for bison, + Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc. -static const short int yycheck[] = -{ - 37, 130, 130, 53, 231, 3, 254, 255, 23, 29, - 112, 55, 56, 15, 20, 30, 53, 85, 273, 274, - 125, 15, 34, 128, 10, 11, 12, 13, 14, 15, - 16, 17, 478, 0, 282, 41, 42, 43, 44, 45, - 46, 47, 131, 41, 50, 57, 120, 302, 61, 154, - 496, 125, 157, 158, 122, 57, 161, 162, 163, 164, - 165, 166, 116, 57, 45, 170, 47, 52, 53, 54, - 23, 125, 109, 110, 111, 10, 11, 12, 13, 14, - 15, 16, 17, 172, 9, 114, 71, 114, 125, 87, - 495, 128, 22, 114, 24, 124, 21, 124, 114, 122, - 505, 122, 125, 123, 114, 114, 122, 99, 100, 124, - 120, 120, 55, 56, 57, 152, 153, 154, 155, 156, - 157, 158, 0, 113, 161, 162, 163, 164, 165, 166, - 167, 168, 169, 170, 120, 203, 204, 205, 32, 33, - 27, 28, 3, 4, 201, 250, 394, 25, 3, 4, - 3, 4, 61, 31, 211, 3, 4, 3, 4, 216, - 217, 113, 24, 41, 42, 43, 44, 45, 46, 47, - 207, 228, 4, 113, 113, 116, 233, 113, 4, 229, - 113, 118, 4, 4, 62, 120, 24, 244, 245, 246, - 116, 418, 229, 420, 4, 24, 24, 119, 248, 10, - 11, 12, 13, 14, 15, 16, 17, 119, 116, 59, - 4, 248, 249, 250, 319, 4, 321, 322, 323, 4, - 4, 7, 4, 291, 329, 64, 65, 66, 67, 68, - 69, 70, 7, 7, 114, 117, 338, 339, 340, 341, - 342, 343, 114, 114, 118, 114, 36, 114, 114, 351, - 352, 353, 354, 310, 114, 114, 114, 114, 114, 316, - 114, 24, 114, 24, 63, 116, 34, 116, 24, 116, - 21, 116, 116, 330, 331, 116, 116, 114, 216, 217, - 116, 318, 319, 320, 321, 322, 323, 324, 325, 287, - 228, 116, 329, 116, 118, 233, 114, 117, 114, 401, - 114, 114, 114, 21, 4, 114, 244, 245, 246, 114, - 116, 114, 369, 114, 371, 24, 114, 114, 375, 4, - 425, 426, 427, 360, 116, 36, 114, 384, 385, 386, - 57, 114, 4, 114, 114, 372, 438, 439, 440, 441, - 117, 443, 444, 445, 446, 114, 24, 114, 114, 478, - 478, 57, 457, 390, 114, 114, 114, 114, 415, 416, - 114, 114, 21, 118, 76, 117, 423, 496, 496, 117, - 120, 117, 310, 114, 117, 432, 114, 114, 316, 36, - 417, 117, 117, 485, 117, 487, 488, 117, 425, 426, - 427, 120, 330, 331, 431, 21, 117, 117, 117, 114, - 437, 21, 459, 21, 114, 21, 97, 97, 97, 97, - 41, 25, 361, 52, 122, 360, 61, 3, 19, 395, - 457, 372, 201, 431, 5, 6, -1, -1, -1, -1, - -1, 369, -1, 371, -1, -1, 493, 375, -1, -1, - -1, 22, -1, 24, -1, 26, 384, 385, 386, 506, - -1, -1, -1, -1, -1, -1, 513, 38, 39, -1, - 517, 518, -1, -1, -1, -1, -1, -1, -1, -1, - -1, -1, -1, -1, -1, -1, -1, 415, 416, -1, - -1, -1, -1, -1, -1, 423, -1, -1, -1, -1, - -1, -1, -1, -1, 432, -1, -1, 78, 79, 80, - 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, - 91, 92, 93, 94, 95, -1, -1, -1, -1, -1, - 101, 459, 103, 104, 105, 106, -1, 108, 109, 110, - -1, -1, -1, -1, -1, -1, -1, 118, -1, -1, - 121, -1, 123, -1, -1, 126, -1, -1, -1, -1, - -1, -1, -1, -1, -1, 493, -1, -1, -1, -1, - -1, -1, -1, -1, -1, -1, -1, -1, 506, -1, - -1, -1, -1, -1, -1, 513, -1, -1, -1, 517, - 518, 5, 6, -1, 8, 9, 10, 11, 12, 13, - 14, 15, 16, 17, 18, 19, 20, 21, 22, -1, - 24, 5, 6, -1, 8, 9, 10, 11, 12, 13, - 14, 15, 16, 17, 18, 19, 20, 21, 22, -1, - 24, -1, -1, -1, 48, -1, -1, -1, -1, -1, - 20, -1, 22, -1, 24, -1, -1, -1, -1, -1, - -1, 31, 32, 33, 48, -1, 3, 4, 5, 6, - 7, 41, 42, 43, 44, 45, 46, 47, -1, -1, - 50, 51, -1, -1, -1, 22, -1, 24, 58, 26, - 27, 28, 62, -1, -1, -1, -1, -1, -1, -1, - -1, 38, 39, -1, -1, -1, -1, -1, -1, -1, - -1, 115, -1, -1, 118, -1, -1, 121, -1, 123, - 124, -1, -1, -1, 61, -1, -1, -1, -1, -1, - -1, 115, -1, -1, 118, -1, -1, 121, -1, 123, - 124, 78, 79, 80, 81, 82, 83, 84, 85, 86, - 87, 88, 89, 90, 91, 92, 93, 94, 95, -1, - -1, -1, -1, -1, 101, -1, 103, 104, 105, 106, - -1, 108, 109, 110, 3, 4, -1, -1, 7, -1, - -1, -1, -1, -1, 121, -1, -1, -1, -1, -1, - -1, -1, -1, -1, -1, -1, -1, 26, 27, 28, - -1, -1, -1, -1, -1, -1, -1, -1, -1, 38, - 39, -1, -1, -1, -1, -1, -1, -1, -1, -1, - -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, - -1, -1, 61, -1, -1, -1, -1, -1, -1, -1, - -1, -1, -1, -1, -1, -1, -1, -1, -1, 78, - 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, - 89, 90, 91, 92, 93, 94, 95, -1, -1, -1, - -1, -1, 101, -1, 103, 104, 105, 106, -1, 108, - 109, 110, -1, -1, -1, -1, -1, -1, -1, -1, - 5, 6, 121, 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, -1, 37, -1, -1, -1, -1, -1, -1, -1, - -1, 5, 6, 48, 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, -1, 37, -1, -1, -1, -1, -1, -1, - -1, -1, 5, 6, 48, 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, - 115, -1, -1, 118, -1, -1, 121, -1, 123, -1, - -1, -1, -1, 5, 6, 48, 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, 115, -1, -1, 118, 37, -1, 121, -1, 123, - -1, -1, -1, -1, 5, 6, 48, 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, 115, -1, -1, 118, 37, 120, 121, -1, - 123, -1, -1, -1, -1, 5, 6, 48, 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, 115, -1, -1, 118, -1, -1, 121, - -1, 123, -1, -1, -1, -1, 5, 6, 48, 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, 115, -1, -1, 118, -1, -1, - 121, -1, 123, -1, -1, -1, -1, 5, 6, 48, - 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, 115, -1, -1, 118, -1, - -1, 121, -1, 123, -1, -1, -1, -1, 5, 6, - 48, 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, 115, -1, -1, 118, - -1, -1, 121, -1, 123, -1, -1, -1, -1, -1, - -1, 48, -1, -1, -1, -1, -1, -1, -1, -1, - -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, - -1, -1, -1, -1, -1, -1, -1, 115, -1, -1, - 118, -1, -1, 121, -1, 123, -1, -1, -1, -1, - 35, -1, -1, -1, -1, -1, -1, -1, -1, -1, - -1, -1, -1, -1, 49, -1, -1, -1, -1, -1, - -1, -1, -1, -1, 59, 60, -1, -1, 115, -1, - -1, 118, -1, -1, 121, -1, 123, 72, 73, 74, - 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, - 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, - 95, 96, 97, 98, -1, -1, 101, 102, 103, 104, - 105, 106, 107, 108, 109, 110, 111, 112 -}; + 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. -/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing - symbol of state STATE-NUM. */ -static const unsigned char yystos[] = -{ - 0, 158, 159, 160, 0, 25, 31, 41, 42, 43, - 44, 45, 46, 47, 62, 139, 177, 179, 181, 188, - 22, 24, 51, 58, 62, 138, 170, 181, 182, 61, - 64, 65, 66, 67, 68, 69, 70, 140, 175, 23, - 189, 190, 30, 124, 178, 189, 52, 53, 54, 71, - 167, 113, 61, 20, 45, 47, 50, 139, 113, 45, - 47, 180, 24, 165, 4, 5, 6, 8, 9, 10, - 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, - 21, 48, 115, 118, 121, 123, 128, 147, 148, 149, - 150, 151, 170, 185, 29, 123, 176, 138, 193, 113, - 113, 113, 113, 118, 168, 165, 147, 32, 33, 157, - 157, 157, 157, 175, 4, 4, 4, 8, 124, 151, - 152, 170, 116, 125, 35, 49, 59, 60, 72, 73, - 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, - 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, - 94, 95, 96, 97, 98, 101, 102, 103, 104, 105, - 106, 107, 108, 109, 110, 111, 112, 130, 131, 132, - 133, 191, 197, 198, 200, 201, 24, 55, 56, 166, - 4, 24, 24, 169, 149, 149, 149, 9, 10, 11, - 12, 13, 14, 15, 16, 17, 18, 19, 134, 135, - 137, 149, 154, 119, 119, 114, 124, 116, 37, 152, - 153, 149, 187, 59, 8, 187, 9, 21, 10, 11, - 12, 13, 14, 15, 16, 17, 134, 135, 136, 140, - 149, 149, 187, 149, 149, 194, 187, 187, 187, 187, - 187, 187, 187, 187, 149, 149, 149, 187, 140, 99, - 100, 114, 120, 163, 164, 162, 27, 28, 3, 4, - 129, 4, 7, 26, 38, 39, 101, 103, 104, 108, - 109, 110, 118, 121, 123, 126, 130, 131, 132, 133, - 155, 185, 161, 151, 151, 151, 37, 149, 172, 173, - 174, 114, 117, 3, 4, 7, 26, 27, 28, 38, - 39, 61, 121, 155, 184, 185, 186, 186, 186, 186, - 147, 114, 142, 114, 142, 186, 118, 114, 36, 114, - 114, 114, 114, 114, 114, 114, 186, 186, 186, 114, - 147, 149, 187, 24, 114, 145, 145, 145, 116, 116, - 116, 116, 116, 116, 120, 154, 156, 156, 124, 156, - 24, 116, 116, 116, 116, 145, 120, 122, 170, 171, - 114, 117, 37, 63, 183, 156, 114, 114, 186, 15, - 57, 15, 114, 199, 186, 118, 149, 187, 149, 187, - 187, 187, 149, 149, 114, 114, 114, 187, 186, 186, - 114, 34, 57, 143, 146, 154, 154, 154, 154, 154, - 154, 114, 120, 122, 124, 154, 154, 154, 154, 37, - 172, 143, 144, 24, 122, 21, 21, 116, 186, 4, - 186, 187, 195, 114, 186, 114, 114, 114, 186, 186, - 186, 116, 149, 24, 4, 145, 199, 36, 114, 114, - 114, 114, 154, 114, 114, 114, 114, 57, 141, 114, - 186, 186, 195, 196, 114, 142, 142, 114, 186, 114, - 187, 187, 187, 196, 186, 117, 149, 154, 154, 154, - 154, 154, 154, 154, 154, 4, 24, 114, 118, 117, - 187, 120, 186, 117, 117, 114, 117, 114, 114, 117, - 117, 117, 117, 21, 120, 136, 192, 36, 120, 154, - 154, 154, 186, 184, 120, 136, 21, 117, 117, 117, - 114, 184, 186, 21, 114, 76, 186, 21, 21, 186, - 186 -}; + 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. */ + +/* This is the parser code that is written into each bison parser + when the %semantic_parser declaration is not specified in the grammar. + It was written by Richard Stallman by simplifying the hairy parser + used when %semantic_parser is specified. */ + +#ifndef YYSTACK_USE_ALLOCA +#ifdef alloca +#define YYSTACK_USE_ALLOCA +#else /* alloca not defined */ +#ifdef __GNUC__ +#define YYSTACK_USE_ALLOCA +#define alloca __builtin_alloca +#else /* not GNU C. */ +#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386)) +#define YYSTACK_USE_ALLOCA +#include <alloca.h> +#else /* not sparc */ +/* We think this test detects Watcom and Microsoft C. */ +/* This used to test MSDOS, but that is a bad idea + since that symbol is in the user namespace. */ +#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__) +#if 0 /* No need for malloc.h, which pollutes the namespace; + instead, just don't use alloca. */ +#include <malloc.h> +#endif +#else /* not MSDOS, or __TURBOC__ */ +#if defined(_AIX) +/* I don't know what this was needed for, but it pollutes the namespace. + So I turned it off. rms, 2 May 1997. */ +/* #include <malloc.h> */ + #pragma alloca +#define YYSTACK_USE_ALLOCA +#else /* not MSDOS, or __TURBOC__, or _AIX */ +#if 0 +#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up, + and on HPUX 10. Eventually we can turn this on. */ +#define YYSTACK_USE_ALLOCA +#define alloca __builtin_alloca +#endif /* __hpux */ +#endif +#endif /* not _AIX */ +#endif /* not MSDOS, or __TURBOC__ */ +#endif /* not sparc */ +#endif /* not GNU C */ +#endif /* alloca not defined */ +#endif /* YYSTACK_USE_ALLOCA not defined */ + +#ifdef YYSTACK_USE_ALLOCA +#define YYSTACK_ALLOC alloca +#else +#define YYSTACK_ALLOC malloc +#endif + +/* Note: there must be only one dollar sign in this file. + It is replaced by the list of actions, each action + as one case of the switch. */ #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) -#define YYEMPTY (-2) +#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. +#define YYABORT goto yyabortlab +#define YYERROR goto yyerrlab1 +/* 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) \ +#define YYBACKUP(token, value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ - { \ - yychar = (Token); \ - yylval = (Value); \ - yytoken = YYTRANSLATE (yychar); \ + { yychar = (token), yylval = (value); \ + yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ - { \ - yyerror (YY_("syntax error: cannot back up")); \ - YYERROR; \ - } \ + { yyerror ("syntax error: cannot back up"); YYERROR; } \ while (0) - #define YYTERROR 1 #define YYERRCODE 256 - -/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. - If N is 0, then set CURRENT to the empty location which ends - the previous symbol: RHS[0] (always defined). */ - -#define YYRHSLOC(Rhs, K) ((Rhs)[K]) -#ifndef YYLLOC_DEFAULT -# define YYLLOC_DEFAULT(Current, Rhs, N) \ - do \ - if (N) \ - { \ - (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \ - (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \ - (Current).last_line = YYRHSLOC (Rhs, N).last_line; \ - (Current).last_column = YYRHSLOC (Rhs, N).last_column; \ - } \ - else \ - { \ - (Current).first_line = (Current).last_line = \ - YYRHSLOC (Rhs, 0).last_line; \ - (Current).first_column = (Current).last_column = \ - YYRHSLOC (Rhs, 0).last_column; \ - } \ - while (0) -#endif - - -/* YY_LOCATION_PRINT -- Print the location on the stream. - This macro was not mandated originally: define only if we know - we won't break user code: when these are the locations we know. */ - -#ifndef YY_LOCATION_PRINT -# if YYLTYPE_IS_TRIVIAL -# define YY_LOCATION_PRINT(File, Loc) \ - fprintf (File, "%d.%d-%d.%d", \ - (Loc).first_line, (Loc).first_column, \ - (Loc).last_line, (Loc).last_column) -# else -# define YY_LOCATION_PRINT(File, Loc) ((void) 0) -# endif +#ifndef YYPURE +#define YYLEX yylex() #endif - -/* YYLEX -- calling `yylex' with the right arguments. */ - +#ifdef YYPURE +#ifdef YYLSP_NEEDED #ifdef YYLEX_PARAM -# define YYLEX yylex (YYLEX_PARAM) +#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM) #else -# define YYLEX yylex () +#define YYLEX yylex(&yylval, &yylloc) #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 YY_SYMBOL_PRINT(Title, Type, Value, Location) \ -do { \ - if (yydebug) \ - { \ - YYFPRINTF (stderr, "%s ", Title); \ - yysymprint (stderr, \ - Type, 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 int *bottom, short int *top) +#else /* not YYLSP_NEEDED */ +#ifdef YYLEX_PARAM +#define YYLEX yylex(&yylval, YYLEX_PARAM) #else -static void -yy_stack_print (bottom, top) - short int *bottom; - short int *top; +#define YYLEX yylex(&yylval) +#endif +#endif /* not YYLSP_NEEDED */ #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) +/* If nonreentrant, generate the variables here */ +#ifndef YYPURE -/*------------------------------------------------. -| Report that the YYRULE is going to be reduced. | -`------------------------------------------------*/ +int yychar; /* the lookahead symbol */ +YYSTYPE yylval; /* the semantic value of the */ + /* lookahead symbol */ -#if defined (__STDC__) || defined (__cplusplus) -static void -yy_reduce_print (int yyrule) -#else -static void -yy_reduce_print (yyrule) - int yyrule; +#ifdef YYLSP_NEEDED +YYLTYPE yylloc; /* location data for the lookahead */ + /* symbol */ #endif -{ - int yyi; - unsigned long int yylno = yyrline[yyrule]; - YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu), ", - 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) +int yynerrs; /* number of parse errors so far */ +#endif /* not YYPURE */ -/* Nonzero means print parse trace. It is left uninitialized so that - multiple parsers can coexist. */ -int yydebug; -#else /* !YYDEBUG */ -# define YYDPRINTF(Args) -# define YY_SYMBOL_PRINT(Title, Type, Value, Location) -# define YY_STACK_PRINT(Bottom, Top) -# define YY_REDUCE_PRINT(Rule) -#endif /* !YYDEBUG */ +#if YYDEBUG != 0 +int yydebug; /* nonzero means print parse trace */ +/* Since this is uninitialized, it does not stop multiple parsers + from coexisting. */ +#endif +/* YYINITDEPTH indicates the initial size of the parser's stacks */ -/* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH -# define YYINITDEPTH 200 +#define YYINITDEPTH 200 #endif -/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only - if the built-in stack extension method is used). +/* YYMAXDEPTH is the 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 - YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) - evaluated with infinite-precision integer arithmetic. */ +#if YYMAXDEPTH == 0 +#undef YYMAXDEPTH +#endif #ifndef YYMAXDEPTH -# define YYMAXDEPTH 10000 +#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 +/* Define __yy_memcpy. Note that the size argument + should be passed with type unsigned int, because that is what the non-GCC + definitions require. With GCC, __builtin_memcpy takes an arg + of type size_t, but it can handle unsigned int. */ + +#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ +#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT) +#else /* not GNU C or C++ */ +#ifndef __cplusplus + +/* This is the most reliable way to avoid incompatibilities + in available built-in functions on various systems. */ +static void +__yy_memcpy (to, from, count) + char *to; + char *from; + unsigned int count; { - const char *yys = yystr; - - while (*yys++ != '\0') - continue; + register char *f = from; + register char *t = to; + register int i = count; - 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 -{ - char *yyd = yydest; - const char *yys = yysrc; - - while ((*yyd++ = *yys++) != '\0') - continue; - - return yyd - 1; + while (i-- > 0) + *t++ = *f++; } -# endif -# endif - -# ifndef yytnamerr -/* Copy to YYRES the contents of YYSTR after stripping away unnecessary - quotes and backslashes, so that it's suitable for yyerror. The - heuristic is that double-quoting is unnecessary unless the string - contains an apostrophe, a comma, or backslash (other than - backslash-backslash). YYSTR is taken from yytname. If YYRES is - null, do not copy; instead, return the length of what the result - would have been. */ -static YYSIZE_T -yytnamerr (char *yyres, const char *yystr) -{ - if (*yystr == '"') - { - size_t yyn = 0; - char const *yyp = yystr; - - for (;;) - switch (*++yyp) - { - case '\'': - case ',': - goto do_not_strip_quotes; - - case '\\': - if (*++yyp != '\\') - goto do_not_strip_quotes; - /* Fall through. */ - default: - if (yyres) - yyres[yyn] = *yyp; - yyn++; - break; - - case '"': - if (yyres) - yyres[yyn] = '\0'; - return yyn; - } - do_not_strip_quotes: ; - } - - if (! yyres) - return yystrlen (yystr); - - return yystpcpy (yyres, yystr) - yyres; -} -# endif - -#endif /* YYERROR_VERBOSE */ - - -#if YYDEBUG -/*--------------------------------. -| Print this symbol on YYOUTPUT. | -`--------------------------------*/ +#else /* __cplusplus */ -#if defined (__STDC__) || defined (__cplusplus) -static void -yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep) -#else +/* This is the most reliable way to avoid incompatibilities + in available built-in functions on various systems. */ static void -yysymprint (yyoutput, yytype, yyvaluep) - FILE *yyoutput; - int yytype; - YYSTYPE *yyvaluep; -#endif +__yy_memcpy (char *to, char *from, unsigned int count) { - /* Pacify ``unused variable'' warnings. */ - (void) yyvaluep; + register char *t = to; + register char *f = from; + register int i = count; - if (yytype < YYNTOKENS) - YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); - else - YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); - - -# ifdef YYPRINT - if (yytype < YYNTOKENS) - YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); -# endif - switch (yytype) - { - default: - break; - } - YYFPRINTF (yyoutput, ")"); + while (i-- > 0) + *t++ = *f++; } -#endif /* ! YYDEBUG */ -/*-----------------------------------------------. -| Release the memory associated to this symbol. | -`-----------------------------------------------*/ - -#if defined (__STDC__) || defined (__cplusplus) -static void -yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep) -#else -static void -yydestruct (yymsg, yytype, yyvaluep) - const char *yymsg; - int yytype; - YYSTYPE *yyvaluep; #endif -{ - /* Pacify ``unused variable'' warnings. */ - (void) yyvaluep; - - if (!yymsg) - yymsg = "Deleting"; - YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); - - switch (yytype) - { - - default: - break; - } -} +#endif +#line 217 "/usr/share/bison.simple" -/* Prevent warnings from -Wmissing-prototypes. */ +/* The user can define YYPARSE_PARAM as the name of an argument to be passed + into yyparse. The argument should have type void *. + It should actually point to an object. + Grammar actions can access the variable by casting it + to the proper pointer type. */ #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 look-ahead symbol. */ -int yychar; - -/* The semantic value of the look-ahead symbol. */ -YYSTYPE yylval; - -/* Number of syntax errors so far. */ -int yynerrs; - - - -/*----------. -| yyparse. | -`----------*/ - +#ifdef __cplusplus +#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM +#define YYPARSE_PARAM_DECL +#else /* not __cplusplus */ +#define YYPARSE_PARAM_ARG YYPARSE_PARAM +#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; +#endif /* not __cplusplus */ +#else /* not YYPARSE_PARAM */ +#define YYPARSE_PARAM_ARG +#define YYPARSE_PARAM_DECL +#endif /* not YYPARSE_PARAM */ + +/* Prevent warning if -Wstrict-prototypes. */ +#ifdef __GNUC__ #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) +int yyparse (void *); #else -int -yyparse () - +int yyparse (void); #endif #endif -{ - - int yystate; - int yyn; - int yyresult; - /* Number of tokens to shift before error messages enabled. */ - int yyerrstatus; - /* Look-ahead 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 int yyssa[YYINITDEPTH]; - short int *yyss = yyssa; - short int *yyssp; +int +yyparse(YYPARSE_PARAM_ARG) + YYPARSE_PARAM_DECL +{ + register int yystate; + register int yyn; + register short *yyssp; + register YYSTYPE *yyvsp; + int yyerrstatus; /* number of tokens to shift before error messages enabled */ + int yychar1 = 0; /* lookahead token as an internal (translated) token number */ - /* The semantic value stack. */ - YYSTYPE yyvsa[YYINITDEPTH]; - YYSTYPE *yyvs = yyvsa; - YYSTYPE *yyvsp; + short yyssa[YYINITDEPTH]; /* the state stack */ + YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ + short *yyss = yyssa; /* refer to the stacks thru separate pointers */ + YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ +#ifdef YYLSP_NEEDED + YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ + YYLTYPE *yyls = yylsa; + YYLTYPE *yylsp; +#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) +#else #define YYPOPSTACK (yyvsp--, yyssp--) +#endif - YYSIZE_T yystacksize = YYINITDEPTH; + int yystacksize = YYINITDEPTH; + int yyfree_stacks = 0; - /* The variables used to return semantic value and location from the - action routines. */ - YYSTYPE yyval; +#ifdef YYPURE + int yychar; + YYSTYPE yylval; + int yynerrs; +#ifdef YYLSP_NEEDED + YYLTYPE yylloc; +#endif +#endif + YYSTYPE yyval; /* the variable used to return */ + /* semantic values from the action */ + /* routines */ - /* When reducing, the number of symbols on the RHS of the reduced - rule. */ int yylen; - YYDPRINTF ((stderr, "Starting parse\n")); +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Starting parse\n"); +#endif yystate = 0; yyerrstatus = 0; @@ -2825,749 +2180,742 @@ yyparse () so that they stay on the same level as the state stack. The wasted elements are never initialized. */ - yyssp = yyss; + yyssp = yyss - 1; yyvsp = yyvs; +#ifdef YYLSP_NEEDED + yylsp = yyls; +#endif - 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++; +/* Push a new state, which is found in yystate . */ +/* In all cases, when you get here, the value and location stacks + have just been pushed. so pushing a state here evens the stacks. */ +yynewstate: - yysetstate: - *yyssp = yystate; + *++yyssp = yystate; - if (yyss + yystacksize - 1 <= yyssp) + if (yyssp >= yyss + yystacksize - 1) { + /* 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; +#ifdef YYLSP_NEEDED + YYLTYPE *yyls1 = yyls; +#endif + /* Get the current used size of the three stacks, in elements. */ - YYSIZE_T yysize = yyssp - yyss + 1; + int size = 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 int *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 (YY_("memory exhausted"), - &yyss1, yysize * sizeof (*yyssp), - &yyvs1, yysize * sizeof (*yyvsp), - - &yystacksize); - - yyss = yyss1; - yyvs = yyvs1; - } + /* Each stack pointer address is followed by the size of + the data in use in that stack, in bytes. */ +#ifdef YYLSP_NEEDED + /* 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, size * sizeof (*yyssp), + &yyvs1, size * sizeof (*yyvsp), + &yyls1, size * sizeof (*yylsp), + &yystacksize); +#else + yyoverflow("parser stack overflow", + &yyss1, size * sizeof (*yyssp), + &yyvs1, size * sizeof (*yyvsp), + &yystacksize); +#endif + + yyss = yyss1; yyvs = yyvs1; +#ifdef YYLSP_NEEDED + yyls = yyls1; +#endif #else /* no yyoverflow */ -# ifndef YYSTACK_RELOCATE - goto yyexhaustedlab; -# else /* Extend the stack our own way. */ - if (YYMAXDEPTH <= yystacksize) - goto yyexhaustedlab; + if (yystacksize >= YYMAXDEPTH) + { + yyerror("parser stack overflow"); + if (yyfree_stacks) + { + free (yyss); + free (yyvs); +#ifdef YYLSP_NEEDED + free (yyls); +#endif + } + return 2; + } yystacksize *= 2; - if (YYMAXDEPTH < yystacksize) + if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; - - { - short int *yyss1 = yyss; - union yyalloc *yyptr = - (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); - if (! yyptr) - goto yyexhaustedlab; - YYSTACK_RELOCATE (yyss); - YYSTACK_RELOCATE (yyvs); - -# undef YYSTACK_RELOCATE - if (yyss1 != yyssa) - YYSTACK_FREE (yyss1); - } -# endif +#ifndef YYSTACK_USE_ALLOCA + yyfree_stacks = 1; +#endif + yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp)); + __yy_memcpy ((char *)yyss, (char *)yyss1, + size * (unsigned int) sizeof (*yyssp)); + yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp)); + __yy_memcpy ((char *)yyvs, (char *)yyvs1, + size * (unsigned int) sizeof (*yyvsp)); +#ifdef YYLSP_NEEDED + yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp)); + __yy_memcpy ((char *)yyls, (char *)yyls1, + size * (unsigned int) sizeof (*yylsp)); +#endif #endif /* no yyoverflow */ - yyssp = yyss + yysize - 1; - yyvsp = yyvs + yysize - 1; - + yyssp = yyss + size - 1; + yyvsp = yyvs + size - 1; +#ifdef YYLSP_NEEDED + yylsp = yyls + size - 1; +#endif - YYDPRINTF ((stderr, "Stack size increased to %lu\n", - (unsigned long int) yystacksize)); +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Stack size increased to %d\n", yystacksize); +#endif - if (yyss + yystacksize - 1 <= yyssp) + if (yyssp >= yyss + yystacksize - 1) YYABORT; } - YYDPRINTF ((stderr, "Entering state %d\n", yystate)); +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Entering state %d\n", yystate); +#endif goto yybackup; - -/*-----------. -| yybackup. | -`-----------*/ -yybackup: + yybackup: /* Do appropriate processing given the current state. */ -/* Read a look-ahead token if we need one and don't already have one. */ +/* 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 look-ahead token. */ + /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; - if (yyn == YYPACT_NINF) + if (yyn == YYFLAG) goto yydefault; - /* Not known => get a look-ahead token if don't already have one. */ + /* Not known => get a lookahead token if don't already have one. */ + + /* yychar is either YYEMPTY or YYEOF + or a valid token in external form. */ - /* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol. */ if (yychar == YYEMPTY) { - YYDPRINTF ((stderr, "Reading a token: ")); +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Reading a token: "); +#endif yychar = YYLEX; } - if (yychar <= YYEOF) + /* Convert token to internal form (in yychar1) for indexing tables with */ + + if (yychar <= 0) /* This means end of input. */ { - yychar = yytoken = YYEOF; - YYDPRINTF ((stderr, "Now at end of input.\n")); + yychar1 = 0; + yychar = YYEOF; /* Don't call YYLEX any more */ + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Now at end of input.\n"); +#endif } else { - yytoken = YYTRANSLATE (yychar); - YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); + yychar1 = YYTRANSLATE(yychar); + +#if YYDEBUG != 0 + if (yydebug) + { + fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); + /* Give the individual parser a way to print the precise meaning + of a token, for further debugging info. */ +#ifdef YYPRINT + YYPRINT (stderr, yychar, yylval); +#endif + fprintf (stderr, ")\n"); + } +#endif } - /* 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) + yyn += yychar1; + if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; + yyn = yytable[yyn]; - if (yyn <= 0) + + /* yyn is what to do for this token type in this state. + Negative => reduce, -yyn is rule number. + Positive => shift, yyn is new state. + New state is final state => don't bother to shift, + just return success. + 0, or most negative number => error. */ + + if (yyn < 0) { - if (yyn == 0 || yyn == YYTABLE_NINF) + if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } + else if (yyn == 0) + goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; - /* Shift the look-ahead token. */ - YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); + /* Shift the lookahead token. */ + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); +#endif /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; +#ifdef YYLSP_NEEDED + *++yylsp = yylloc; +#endif - - /* Count tokens shifted since error; after three, turn off error - status. */ - if (yyerrstatus) - yyerrstatus--; + /* 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. | -`-----------------------------------------------------------*/ +/* Do the default action for the current state. */ yydefault: + yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; - goto yyreduce; - -/*-----------------------------. -| yyreduce -- Do a reduction. | -`-----------------------------*/ +/* Do a reduction. yyn is the number of a rule to reduce with. */ yyreduce: - /* yyn is the number of a rule to reduce with. */ yylen = yyr2[yyn]; + if (yylen > 0) + yyval = yyvsp[1-yylen]; /* implement default value of the action */ - /* If YYLEN is nonzero, implement the default value of the action: - `$$ = $1'. +#if YYDEBUG != 0 + if (yydebug) + { + int i; - 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]; + fprintf (stderr, "Reducing via rule %d (line %d), ", + yyn, yyrline[yyn]); + /* Print the symbols being reduced, and their result. */ + for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) + fprintf (stderr, "%s ", yytname[yyrhs[i]]); + fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); + } +#endif - YY_REDUCE_PRINT (yyn); - switch (yyn) - { - case 3: -#line 1140 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((yyvsp[0].UIntVal) > (uint32_t)INT32_MAX) // Outside of my range! + + switch (yyn) { + +case 2: +#line 1140 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (yyvsp[0].UIntVal > (uint32_t)INT32_MAX) // Outside of my range! GEN_ERROR("Value too large for type!"); - (yyval.SIntVal) = (int32_t)(yyvsp[0].UIntVal); + yyval.SIntVal = (int32_t)yyvsp[0].UIntVal; CHECK_FOR_ERROR -;} - break; - - case 5: -#line 1149 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((yyvsp[0].UInt64Val) > (uint64_t)INT64_MAX) // Outside of my range! +; + break;} +case 4: +#line 1149 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (yyvsp[0].UInt64Val > (uint64_t)INT64_MAX) // Outside of my range! GEN_ERROR("Value too large for type!"); - (yyval.SInt64Val) = (int64_t)(yyvsp[0].UInt64Val); + yyval.SInt64Val = (int64_t)yyvsp[0].UInt64Val; CHECK_FOR_ERROR -;} - break; - - case 38: -#line 1173 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.StrVal) = (yyvsp[-1].StrVal); - CHECK_FOR_ERROR - ;} - break; - - case 39: -#line 1177 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.StrVal) = 0; +; + break;} +case 37: +#line 1173 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.StrVal = yyvsp[-1].StrVal; CHECK_FOR_ERROR - ;} - break; - - case 40: -#line 1182 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.Linkage) = GlobalValue::InternalLinkage; ;} - break; - - case 41: -#line 1183 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.Linkage) = GlobalValue::LinkOnceLinkage; ;} - break; - - case 42: -#line 1184 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.Linkage) = GlobalValue::WeakLinkage; ;} - break; - - case 43: -#line 1185 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.Linkage) = GlobalValue::AppendingLinkage; ;} - break; - - case 44: -#line 1186 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.Linkage) = GlobalValue::DLLImportLinkage; ;} - break; - - case 45: -#line 1187 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.Linkage) = GlobalValue::DLLExportLinkage; ;} - break; - - case 46: -#line 1188 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.Linkage) = GlobalValue::ExternalWeakLinkage; ;} - break; - - case 47: -#line 1189 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.Linkage) = GlobalValue::ExternalLinkage; ;} - break; - - case 48: -#line 1191 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.UIntVal) = CallingConv::C; ;} - break; - - case 49: -#line 1192 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.UIntVal) = CallingConv::C; ;} - break; - - case 50: -#line 1193 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.UIntVal) = CallingConv::CSRet; ;} - break; - - case 51: -#line 1194 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.UIntVal) = CallingConv::Fast; ;} - break; - - case 52: -#line 1195 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.UIntVal) = CallingConv::Cold; ;} - break; - - case 53: -#line 1196 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.UIntVal) = CallingConv::X86_StdCall; ;} - break; - - case 54: -#line 1197 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.UIntVal) = CallingConv::X86_FastCall; ;} - break; - - case 55: -#line 1198 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((unsigned)(yyvsp[0].UInt64Val) != (yyvsp[0].UInt64Val)) + ; + break;} +case 38: +#line 1177 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.StrVal = 0; + CHECK_FOR_ERROR + ; + break;} +case 39: +#line 1182 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.Linkage = GlobalValue::InternalLinkage; ; + break;} +case 40: +#line 1183 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.Linkage = GlobalValue::LinkOnceLinkage; ; + break;} +case 41: +#line 1184 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.Linkage = GlobalValue::WeakLinkage; ; + break;} +case 42: +#line 1185 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.Linkage = GlobalValue::AppendingLinkage; ; + break;} +case 43: +#line 1186 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.Linkage = GlobalValue::DLLImportLinkage; ; + break;} +case 44: +#line 1187 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.Linkage = GlobalValue::DLLExportLinkage; ; + break;} +case 45: +#line 1188 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.Linkage = GlobalValue::ExternalWeakLinkage; ; + break;} +case 46: +#line 1189 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.Linkage = GlobalValue::ExternalLinkage; ; + break;} +case 47: +#line 1191 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.UIntVal = CallingConv::C; ; + break;} +case 48: +#line 1192 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.UIntVal = CallingConv::C; ; + break;} +case 49: +#line 1193 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.UIntVal = CallingConv::CSRet; ; + break;} +case 50: +#line 1194 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.UIntVal = CallingConv::Fast; ; + break;} +case 51: +#line 1195 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.UIntVal = CallingConv::Cold; ; + break;} +case 52: +#line 1196 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.UIntVal = CallingConv::X86_StdCall; ; + break;} +case 53: +#line 1197 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.UIntVal = CallingConv::X86_FastCall; ; + break;} +case 54: +#line 1198 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if ((unsigned)yyvsp[0].UInt64Val != yyvsp[0].UInt64Val) GEN_ERROR("Calling conv too large!"); - (yyval.UIntVal) = (yyvsp[0].UInt64Val); + yyval.UIntVal = yyvsp[0].UInt64Val; CHECK_FOR_ERROR - ;} - break; - - case 56: -#line 1207 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.UIntVal) = 0; ;} - break; - - case 57: -#line 1208 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.UIntVal) = (yyvsp[0].UInt64Val); - if ((yyval.UIntVal) != 0 && !isPowerOf2_32((yyval.UIntVal))) + ; + break;} +case 55: +#line 1207 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.UIntVal = 0; ; + break;} +case 56: +#line 1208 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.UIntVal = yyvsp[0].UInt64Val; + if (yyval.UIntVal != 0 && !isPowerOf2_32(yyval.UIntVal)) GEN_ERROR("Alignment must be a power of two!"); CHECK_FOR_ERROR -;} - break; - - case 58: -#line 1214 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.UIntVal) = 0; ;} - break; - - case 59: -#line 1215 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.UIntVal) = (yyvsp[0].UInt64Val); - if ((yyval.UIntVal) != 0 && !isPowerOf2_32((yyval.UIntVal))) +; + break;} +case 57: +#line 1214 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.UIntVal = 0; ; + break;} +case 58: +#line 1215 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.UIntVal = yyvsp[0].UInt64Val; + if (yyval.UIntVal != 0 && !isPowerOf2_32(yyval.UIntVal)) GEN_ERROR("Alignment must be a power of two!"); CHECK_FOR_ERROR -;} - break; - - case 60: -#line 1223 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - for (unsigned i = 0, e = strlen((yyvsp[0].StrVal)); i != e; ++i) - if ((yyvsp[0].StrVal)[i] == '"' || (yyvsp[0].StrVal)[i] == '\\') +; + break;} +case 59: +#line 1223 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + for (unsigned i = 0, e = strlen(yyvsp[0].StrVal); i != e; ++i) + if (yyvsp[0].StrVal[i] == '"' || yyvsp[0].StrVal[i] == '\\') GEN_ERROR("Invalid character in section name!"); - (yyval.StrVal) = (yyvsp[0].StrVal); + yyval.StrVal = yyvsp[0].StrVal; CHECK_FOR_ERROR -;} - break; - - case 61: -#line 1231 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.StrVal) = 0; ;} - break; - - case 62: -#line 1232 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.StrVal) = (yyvsp[0].StrVal); ;} - break; - - case 63: -#line 1237 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - {;} - break; - - case 64: -#line 1238 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - {;} - break; - - case 65: -#line 1239 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - CurGV->setSection((yyvsp[0].StrVal)); - free((yyvsp[0].StrVal)); +; + break;} +case 60: +#line 1231 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.StrVal = 0; ; + break;} +case 61: +#line 1232 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.StrVal = yyvsp[0].StrVal; ; + break;} +case 62: +#line 1237 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{; + break;} +case 63: +#line 1238 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{; + break;} +case 64: +#line 1239 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + CurGV->setSection(yyvsp[0].StrVal); + free(yyvsp[0].StrVal); CHECK_FOR_ERROR - ;} - break; - - case 66: -#line 1244 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((yyvsp[0].UInt64Val) != 0 && !isPowerOf2_32((yyvsp[0].UInt64Val))) + ; + break;} +case 65: +#line 1244 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (yyvsp[0].UInt64Val != 0 && !isPowerOf2_32(yyvsp[0].UInt64Val)) GEN_ERROR("Alignment must be a power of two!"); - CurGV->setAlignment((yyvsp[0].UInt64Val)); - CHECK_FOR_ERROR - ;} - break; - - case 68: -#line 1258 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.TypeVal) = new PATypeHolder((yyvsp[0].PrimType)); ;} - break; - - case 70: -#line 1259 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.TypeVal) = new PATypeHolder((yyvsp[0].PrimType)); ;} - break; - - case 71: -#line 1261 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + CurGV->setAlignment(yyvsp[0].UInt64Val); + CHECK_FOR_ERROR + ; + break;} +case 67: +#line 1258 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType); ; + break;} +case 69: +#line 1259 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType); ; + break;} +case 70: +#line 1261 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ if (!UpRefs.empty()) - GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[0].TypeVal))->getDescription()); - (yyval.TypeVal) = (yyvsp[0].TypeVal); - CHECK_FOR_ERROR - ;} - break; - - case 85: -#line 1273 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.TypeVal) = new PATypeHolder(OpaqueType::get()); + GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription()); + yyval.TypeVal = yyvsp[0].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 86: -#line 1277 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.TypeVal) = new PATypeHolder((yyvsp[0].PrimType)); + ; + break;} +case 84: +#line 1273 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.TypeVal = new PATypeHolder(OpaqueType::get()); CHECK_FOR_ERROR - ;} - break; - - case 87: -#line 1281 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Named types are also simple types... - const Type* tmp = getTypeVal((yyvsp[0].ValIDVal)); + ; + break;} +case 85: +#line 1277 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType); + CHECK_FOR_ERROR + ; + break;} +case 86: +#line 1281 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Named types are also simple types... + const Type* tmp = getTypeVal(yyvsp[0].ValIDVal); CHECK_FOR_ERROR - (yyval.TypeVal) = new PATypeHolder(tmp); -;} - break; - - case 88: -#line 1289 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Type UpReference - if ((yyvsp[0].UInt64Val) > (uint64_t)~0U) GEN_ERROR("Value out of range!"); + yyval.TypeVal = new PATypeHolder(tmp); +; + break;} +case 87: +#line 1289 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Type UpReference + if (yyvsp[0].UInt64Val > (uint64_t)~0U) GEN_ERROR("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); + UpRefs.push_back(UpRefRecord((unsigned)yyvsp[0].UInt64Val, OT)); // Add to vector... + yyval.TypeVal = new PATypeHolder(OT); UR_OUT("New Upreference!\n"); CHECK_FOR_ERROR - ;} - break; - - case 89: -#line 1297 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Function derived type? + ; + break;} +case 88: +#line 1297 "/Users/sabre/cvs/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) + 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 - CHECK_FOR_ERROR - ;} - break; - - case 90: -#line 1310 "/proj/llvm/llvm-4/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); - CHECK_FOR_ERROR - ;} - break; - - case 91: -#line 1315 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Packed array type? - const llvm::Type* ElemTy = (yyvsp[-1].TypeVal)->get(); - if ((unsigned)(yyvsp[-3].UInt64Val) != (yyvsp[-3].UInt64Val)) + 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 + CHECK_FOR_ERROR + ; + break;} +case 89: +#line 1310 "/Users/sabre/cvs/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; + CHECK_FOR_ERROR + ; + break;} +case 90: +#line 1315 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Packed array type? + const llvm::Type* ElemTy = yyvsp[-1].TypeVal->get(); + if ((unsigned)yyvsp[-3].UInt64Val != yyvsp[-3].UInt64Val) GEN_ERROR("Unsigned result not equal to signed result"); if (!ElemTy->isPrimitiveType()) GEN_ERROR("Elemental type of a PackedType must be primitive"); - if (!isPowerOf2_32((yyvsp[-3].UInt64Val))) + if (!isPowerOf2_32(yyvsp[-3].UInt64Val)) GEN_ERROR("Vector length should be a power of 2!"); - (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(PackedType::get(*(yyvsp[-1].TypeVal), (unsigned)(yyvsp[-3].UInt64Val)))); - delete (yyvsp[-1].TypeVal); + yyval.TypeVal = new PATypeHolder(HandleUpRefs(PackedType::get(*yyvsp[-1].TypeVal, (unsigned)yyvsp[-3].UInt64Val))); + delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 92: -#line 1327 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Structure type? + ; + break;} +case 91: +#line 1327 "/Users/sabre/cvs/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) + 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); - CHECK_FOR_ERROR - ;} - break; - - case 93: -#line 1337 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Empty structure type? - (yyval.TypeVal) = new PATypeHolder(StructType::get(std::vector<const Type*>())); - CHECK_FOR_ERROR - ;} - break; - - case 94: -#line 1341 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Pointer type? - if (*(yyvsp[-1].TypeVal) == Type::LabelTy) + yyval.TypeVal = new PATypeHolder(HandleUpRefs(StructType::get(Elements))); + delete yyvsp[-1].TypeList; + CHECK_FOR_ERROR + ; + break;} +case 92: +#line 1337 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Empty structure type? + yyval.TypeVal = new PATypeHolder(StructType::get(std::vector<const Type*>())); + CHECK_FOR_ERROR + ; + break;} +case 93: +#line 1341 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Pointer type? + if (*yyvsp[-1].TypeVal == Type::LabelTy) GEN_ERROR("Cannot form a pointer to a basic block"); - (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(PointerType::get(*(yyvsp[-1].TypeVal)))); - delete (yyvsp[-1].TypeVal); - CHECK_FOR_ERROR - ;} - break; - - case 95: -#line 1352 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.TypeList) = new std::list<PATypeHolder>(); - (yyval.TypeList)->push_back(*(yyvsp[0].TypeVal)); delete (yyvsp[0].TypeVal); + yyval.TypeVal = new PATypeHolder(HandleUpRefs(PointerType::get(*yyvsp[-1].TypeVal))); + delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 96: -#line 1357 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - ((yyval.TypeList)=(yyvsp[-2].TypeList))->push_back(*(yyvsp[0].TypeVal)); delete (yyvsp[0].TypeVal); + ; + break;} +case 94: +#line 1352 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.TypeList = new std::list<PATypeHolder>(); + yyval.TypeList->push_back(*yyvsp[0].TypeVal); delete yyvsp[0].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 98: -#line 1364 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - ((yyval.TypeList)=(yyvsp[-2].TypeList))->push_back(Type::VoidTy); + ; + break;} +case 95: +#line 1357 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + (yyval.TypeList=yyvsp[-2].TypeList)->push_back(*yyvsp[0].TypeVal); delete yyvsp[0].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 99: -#line 1368 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - ((yyval.TypeList) = new std::list<PATypeHolder>())->push_back(Type::VoidTy); + ; + break;} +case 97: +#line 1364 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + (yyval.TypeList=yyvsp[-2].TypeList)->push_back(Type::VoidTy); CHECK_FOR_ERROR - ;} - break; - - case 100: -#line 1372 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.TypeList) = new std::list<PATypeHolder>(); + ; + break;} +case 98: +#line 1368 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + (yyval.TypeList = new std::list<PATypeHolder>())->push_back(Type::VoidTy); CHECK_FOR_ERROR - ;} - break; - - case 101: -#line 1383 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Nonempty unsized arr - const ArrayType *ATy = dyn_cast<ArrayType>((yyvsp[-3].TypeVal)->get()); + ; + break;} +case 99: +#line 1372 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.TypeList = new std::list<PATypeHolder>(); + CHECK_FOR_ERROR + ; + break;} +case 100: +#line 1383 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Nonempty unsized arr + const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-3].TypeVal->get()); if (ATy == 0) GEN_ERROR("Cannot make array constant with type: '" + - (*(yyvsp[-3].TypeVal))->getDescription() + "'!"); + (*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()) + if (NumElements != -1 && NumElements != (int)yyvsp[-1].ConstVector->size()) GEN_ERROR("Type mismatch: constant sized array initialized with " + - utostr((yyvsp[-1].ConstVector)->size()) + " arguments, but has size of " + + 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()) + for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) { + if (ETy != (*yyvsp[-1].ConstVector)[i]->getType()) GEN_ERROR("Element #" + utostr(i) + " is not of type '" + ETy->getDescription() +"' as required!\nIt is of type '"+ - (*(yyvsp[-1].ConstVector))[i]->getType()->getDescription() + "'."); + (*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'."); } - (yyval.ConstVal) = ConstantArray::get(ATy, *(yyvsp[-1].ConstVector)); - delete (yyvsp[-3].TypeVal); delete (yyvsp[-1].ConstVector); + yyval.ConstVal = ConstantArray::get(ATy, *yyvsp[-1].ConstVector); + delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector; CHECK_FOR_ERROR - ;} - break; - - case 102: -#line 1409 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - const ArrayType *ATy = dyn_cast<ArrayType>((yyvsp[-2].TypeVal)->get()); + ; + break;} +case 101: +#line 1409 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get()); if (ATy == 0) GEN_ERROR("Cannot make array constant with type: '" + - (*(yyvsp[-2].TypeVal))->getDescription() + "'!"); + (*yyvsp[-2].TypeVal)->getDescription() + "'!"); int NumElements = ATy->getNumElements(); if (NumElements != -1 && NumElements != 0) GEN_ERROR("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); + yyval.ConstVal = ConstantArray::get(ATy, std::vector<Constant*>()); + delete yyvsp[-2].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 103: -#line 1423 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - const ArrayType *ATy = dyn_cast<ArrayType>((yyvsp[-2].TypeVal)->get()); + ; + break;} +case 102: +#line 1423 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get()); if (ATy == 0) GEN_ERROR("Cannot make array constant with type: '" + - (*(yyvsp[-2].TypeVal))->getDescription() + "'!"); + (*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))) + char *EndStr = UnEscapeLexed(yyvsp[0].StrVal, true); + if (NumElements != -1 && NumElements != (EndStr-yyvsp[0].StrVal)) GEN_ERROR("Can't build string constant of size " + - itostr((int)(EndStr-(yyvsp[0].StrVal))) + + itostr((int)(EndStr-yyvsp[0].StrVal)) + " when array has size " + itostr(NumElements) + "!"); std::vector<Constant*> Vals; if (ETy == Type::SByteTy) { - for (signed char *C = (signed char *)(yyvsp[0].StrVal); C != (signed char *)EndStr; ++C) + for (signed char *C = (signed char *)yyvsp[0].StrVal; C != (signed char *)EndStr; ++C) Vals.push_back(ConstantInt::get(ETy, *C)); } else if (ETy == Type::UByteTy) { - for (unsigned char *C = (unsigned char *)(yyvsp[0].StrVal); + for (unsigned char *C = (unsigned char *)yyvsp[0].StrVal; C != (unsigned char*)EndStr; ++C) Vals.push_back(ConstantInt::get(ETy, *C)); } else { - free((yyvsp[0].StrVal)); + free(yyvsp[0].StrVal); GEN_ERROR("Cannot build string arrays of non byte sized elements!"); } - free((yyvsp[0].StrVal)); - (yyval.ConstVal) = ConstantArray::get(ATy, Vals); - delete (yyvsp[-2].TypeVal); - CHECK_FOR_ERROR - ;} - break; - - case 104: -#line 1453 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Nonempty unsized arr - const PackedType *PTy = dyn_cast<PackedType>((yyvsp[-3].TypeVal)->get()); + free(yyvsp[0].StrVal); + yyval.ConstVal = ConstantArray::get(ATy, Vals); + delete yyvsp[-2].TypeVal; + CHECK_FOR_ERROR + ; + break;} +case 103: +#line 1453 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Nonempty unsized arr + const PackedType *PTy = dyn_cast<PackedType>(yyvsp[-3].TypeVal->get()); if (PTy == 0) GEN_ERROR("Cannot make packed constant with type: '" + - (*(yyvsp[-3].TypeVal))->getDescription() + "'!"); + (*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()) + if (NumElements != -1 && NumElements != (int)yyvsp[-1].ConstVector->size()) GEN_ERROR("Type mismatch: constant sized packed initialized with " + - utostr((yyvsp[-1].ConstVector)->size()) + " arguments, but has size of " + + 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()) + for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) { + if (ETy != (*yyvsp[-1].ConstVector)[i]->getType()) GEN_ERROR("Element #" + utostr(i) + " is not of type '" + ETy->getDescription() +"' as required!\nIt is of type '"+ - (*(yyvsp[-1].ConstVector))[i]->getType()->getDescription() + "'."); + (*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'."); } - (yyval.ConstVal) = ConstantPacked::get(PTy, *(yyvsp[-1].ConstVector)); - delete (yyvsp[-3].TypeVal); delete (yyvsp[-1].ConstVector); + yyval.ConstVal = ConstantPacked::get(PTy, *yyvsp[-1].ConstVector); + delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector; CHECK_FOR_ERROR - ;} - break; - - case 105: -#line 1479 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - const StructType *STy = dyn_cast<StructType>((yyvsp[-3].TypeVal)->get()); + ; + break;} +case 104: +#line 1479 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + const StructType *STy = dyn_cast<StructType>(yyvsp[-3].TypeVal->get()); if (STy == 0) GEN_ERROR("Cannot make struct constant with type: '" + - (*(yyvsp[-3].TypeVal))->getDescription() + "'!"); + (*yyvsp[-3].TypeVal)->getDescription() + "'!"); - if ((yyvsp[-1].ConstVector)->size() != STy->getNumContainedTypes()) + if (yyvsp[-1].ConstVector->size() != STy->getNumContainedTypes()) GEN_ERROR("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)) + for (unsigned i = 0, e = yyvsp[-1].ConstVector->size(); i != e; ++i) + if ((*yyvsp[-1].ConstVector)[i]->getType() != STy->getElementType(i)) GEN_ERROR("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); + yyval.ConstVal = ConstantStruct::get(STy, *yyvsp[-1].ConstVector); + delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector; CHECK_FOR_ERROR - ;} - break; - - case 106: -#line 1500 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - const StructType *STy = dyn_cast<StructType>((yyvsp[-2].TypeVal)->get()); + ; + break;} +case 105: +#line 1500 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + const StructType *STy = dyn_cast<StructType>(yyvsp[-2].TypeVal->get()); if (STy == 0) GEN_ERROR("Cannot make struct constant with type: '" + - (*(yyvsp[-2].TypeVal))->getDescription() + "'!"); + (*yyvsp[-2].TypeVal)->getDescription() + "'!"); if (STy->getNumContainedTypes() != 0) GEN_ERROR("Illegal number of initializers for structure type!"); - (yyval.ConstVal) = ConstantStruct::get(STy, std::vector<Constant*>()); - delete (yyvsp[-2].TypeVal); + yyval.ConstVal = ConstantStruct::get(STy, std::vector<Constant*>()); + delete yyvsp[-2].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 107: -#line 1513 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - const PointerType *PTy = dyn_cast<PointerType>((yyvsp[-1].TypeVal)->get()); + ; + break;} +case 106: +#line 1513 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + const PointerType *PTy = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get()); if (PTy == 0) GEN_ERROR("Cannot make null pointer constant with type: '" + - (*(yyvsp[-1].TypeVal))->getDescription() + "'!"); + (*yyvsp[-1].TypeVal)->getDescription() + "'!"); - (yyval.ConstVal) = ConstantPointerNull::get(PTy); - delete (yyvsp[-1].TypeVal); + yyval.ConstVal = ConstantPointerNull::get(PTy); + delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 108: -#line 1523 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ConstVal) = UndefValue::get((yyvsp[-1].TypeVal)->get()); - delete (yyvsp[-1].TypeVal); + ; + break;} +case 107: +#line 1523 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ConstVal = UndefValue::get(yyvsp[-1].TypeVal->get()); + delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 109: -#line 1528 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - const PointerType *Ty = dyn_cast<PointerType>((yyvsp[-1].TypeVal)->get()); + ; + break;} +case 108: +#line 1528 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + const PointerType *Ty = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get()); if (Ty == 0) GEN_ERROR("Global const reference must be a pointer type!"); @@ -3581,7 +2929,7 @@ yyreduce: Function *SavedCurFn = CurFun.CurrentFunction; CurFun.CurrentFunction = 0; - Value *V = getValNonImprovising(Ty, (yyvsp[0].ValIDVal)); + Value *V = getValNonImprovising(Ty, yyvsp[0].ValIDVal); CHECK_FOR_ERROR CurFun.CurrentFunction = SavedCurFn; @@ -3596,14 +2944,14 @@ yyreduce: // 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))); + 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(); + yyvsp[0].ValIDVal.destroy(); } else { std::string Name; - if ((yyvsp[0].ValIDVal).Type == ValID::NameVal) Name = (yyvsp[0].ValIDVal).Name; + if (yyvsp[0].ValIDVal.Type == ValID::NameVal) Name = yyvsp[0].ValIDVal.Name; // Create the forward referenced global. GlobalValue *GV; @@ -3618,165 +2966,154 @@ yyreduce: } // 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)); + 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 + yyval.ConstVal = cast<GlobalValue>(V); + delete yyvsp[-1].TypeVal; // Free the type handle CHECK_FOR_ERROR - ;} - break; - - case 110: -#line 1589 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((yyvsp[-1].TypeVal)->get() != (yyvsp[0].ConstVal)->getType()) + ; + break;} +case 109: +#line 1589 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (yyvsp[-1].TypeVal->get() != yyvsp[0].ConstVal->getType()) GEN_ERROR("Mismatched types for constant expression!"); - (yyval.ConstVal) = (yyvsp[0].ConstVal); - delete (yyvsp[-1].TypeVal); + yyval.ConstVal = yyvsp[0].ConstVal; + delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 111: -#line 1596 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - const Type *Ty = (yyvsp[-1].TypeVal)->get(); + ; + break;} +case 110: +#line 1596 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + const Type *Ty = yyvsp[-1].TypeVal->get(); if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty)) GEN_ERROR("Cannot create a null initialized value of this type!"); - (yyval.ConstVal) = Constant::getNullValue(Ty); - delete (yyvsp[-1].TypeVal); - CHECK_FOR_ERROR - ;} - break; - - case 112: -#line 1605 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // integral constants - if (!ConstantInt::isValueValidForType((yyvsp[-1].PrimType), (yyvsp[0].SInt64Val))) + yyval.ConstVal = Constant::getNullValue(Ty); + delete yyvsp[-1].TypeVal; + CHECK_FOR_ERROR + ; + break;} +case 111: +#line 1605 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // integral constants + if (!ConstantInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].SInt64Val)) GEN_ERROR("Constant value doesn't fit in type!"); - (yyval.ConstVal) = ConstantInt::get((yyvsp[-1].PrimType), (yyvsp[0].SInt64Val)); - CHECK_FOR_ERROR - ;} - break; - - case 113: -#line 1611 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // integral constants - if (!ConstantInt::isValueValidForType((yyvsp[-1].PrimType), (yyvsp[0].UInt64Val))) + yyval.ConstVal = ConstantInt::get(yyvsp[-1].PrimType, yyvsp[0].SInt64Val); + CHECK_FOR_ERROR + ; + break;} +case 112: +#line 1611 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // integral constants + if (!ConstantInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].UInt64Val)) GEN_ERROR("Constant value doesn't fit in type!"); - (yyval.ConstVal) = ConstantInt::get((yyvsp[-1].PrimType), (yyvsp[0].UInt64Val)); - CHECK_FOR_ERROR - ;} - break; - - case 114: -#line 1617 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Boolean constants - (yyval.ConstVal) = ConstantBool::getTrue(); - CHECK_FOR_ERROR - ;} - break; - - case 115: -#line 1621 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Boolean constants - (yyval.ConstVal) = ConstantBool::getFalse(); - CHECK_FOR_ERROR - ;} - break; - - case 116: -#line 1625 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Float & Double constants - if (!ConstantFP::isValueValidForType((yyvsp[-1].PrimType), (yyvsp[0].FPVal))) + yyval.ConstVal = ConstantInt::get(yyvsp[-1].PrimType, yyvsp[0].UInt64Val); + CHECK_FOR_ERROR + ; + break;} +case 113: +#line 1617 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Boolean constants + yyval.ConstVal = ConstantBool::getTrue(); + CHECK_FOR_ERROR + ; + break;} +case 114: +#line 1621 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Boolean constants + yyval.ConstVal = ConstantBool::getFalse(); + CHECK_FOR_ERROR + ; + break;} +case 115: +#line 1625 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Float & Double constants + if (!ConstantFP::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].FPVal)) GEN_ERROR("Floating point constant invalid for type!!"); - (yyval.ConstVal) = ConstantFP::get((yyvsp[-1].PrimType), (yyvsp[0].FPVal)); + yyval.ConstVal = ConstantFP::get(yyvsp[-1].PrimType, yyvsp[0].FPVal); CHECK_FOR_ERROR - ;} - break; - - case 117: -#line 1633 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!(yyvsp[-3].ConstVal)->getType()->isFirstClassType()) + ; + break;} +case 116: +#line 1633 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!yyvsp[-3].ConstVal->getType()->isFirstClassType()) GEN_ERROR("cast constant expression from a non-primitive type: '" + - (yyvsp[-3].ConstVal)->getType()->getDescription() + "'!"); - if (!(yyvsp[-1].TypeVal)->get()->isFirstClassType()) + yyvsp[-3].ConstVal->getType()->getDescription() + "'!"); + if (!yyvsp[-1].TypeVal->get()->isFirstClassType()) GEN_ERROR("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); - CHECK_FOR_ERROR - ;} - break; - - case 118: -#line 1644 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!isa<PointerType>((yyvsp[-2].ConstVal)->getType())) + yyvsp[-1].TypeVal->get()->getDescription() + "'!"); + yyval.ConstVal = ConstantExpr::getCast(yyvsp[-3].ConstVal, yyvsp[-1].TypeVal->get()); + delete yyvsp[-1].TypeVal; + CHECK_FOR_ERROR + ; + break;} +case 117: +#line 1644 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!isa<PointerType>(yyvsp[-2].ConstVal->getType())) GEN_ERROR("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) + 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 (ConstantInt *CUI = dyn_cast<ConstantInt>((*(yyvsp[-1].ValueList))[i])) + if (ConstantInt *CUI = dyn_cast<ConstantInt>((*yyvsp[-1].ValueList)[i])) if (CUI->getType() == Type::UByteTy) - (*(yyvsp[-1].ValueList))[i] = ConstantExpr::getCast(CUI, Type::UIntTy); + (*yyvsp[-1].ValueList)[i] = ConstantExpr::getCast(CUI, Type::UIntTy); const Type *IdxTy = - GetElementPtrInst::getIndexedType((yyvsp[-2].ConstVal)->getType(), *(yyvsp[-1].ValueList), true); + GetElementPtrInst::getIndexedType(yyvsp[-2].ConstVal->getType(), *yyvsp[-1].ValueList, true); if (!IdxTy) GEN_ERROR("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])) + 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 GEN_ERROR("Indices to constant getelementptr must be constants!"); - delete (yyvsp[-1].ValueList); + delete yyvsp[-1].ValueList; - (yyval.ConstVal) = ConstantExpr::getGetElementPtr((yyvsp[-2].ConstVal), IdxVec); + yyval.ConstVal = ConstantExpr::getGetElementPtr(yyvsp[-2].ConstVal, IdxVec); CHECK_FOR_ERROR - ;} - break; - - case 119: -#line 1676 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((yyvsp[-5].ConstVal)->getType() != Type::BoolTy) + ; + break;} +case 118: +#line 1676 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (yyvsp[-5].ConstVal->getType() != Type::BoolTy) GEN_ERROR("Select condition must be of boolean type!"); - if ((yyvsp[-3].ConstVal)->getType() != (yyvsp[-1].ConstVal)->getType()) + if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType()) GEN_ERROR("Select operand types must match!"); - (yyval.ConstVal) = ConstantExpr::getSelect((yyvsp[-5].ConstVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); + yyval.ConstVal = ConstantExpr::getSelect(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); CHECK_FOR_ERROR - ;} - break; - - case 120: -#line 1684 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((yyvsp[-3].ConstVal)->getType() != (yyvsp[-1].ConstVal)->getType()) + ; + break;} +case 119: +#line 1684 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType()) GEN_ERROR("Binary operator types must match!"); // First, make sure we're dealing with the right opcode by upgrading from // obsolete versions. - sanitizeOpCode((yyvsp[-5].BinaryOpVal),(yyvsp[-3].ConstVal)->getType()); + sanitizeOpCode(yyvsp[-5].BinaryOpVal,yyvsp[-3].ConstVal->getType()); CHECK_FOR_ERROR; // 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).opcode, (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); + if (!isa<PointerType>(yyvsp[-3].ConstVal->getType())) { + yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal.opcode, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); } else { const Type *IntPtrTy = 0; switch (CurModule.CurrentModule->getPointerSize()) { @@ -3784,154 +3121,138 @@ yyreduce: case Module::Pointer64: IntPtrTy = Type::LongTy; break; default: GEN_ERROR("invalid pointer binary constant expr!"); } - (yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].BinaryOpVal).opcode, ConstantExpr::getCast((yyvsp[-3].ConstVal), IntPtrTy), - ConstantExpr::getCast((yyvsp[-1].ConstVal), IntPtrTy)); - (yyval.ConstVal) = ConstantExpr::getCast((yyval.ConstVal), (yyvsp[-3].ConstVal)->getType()); + yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal.opcode, ConstantExpr::getCast(yyvsp[-3].ConstVal, IntPtrTy), + ConstantExpr::getCast(yyvsp[-1].ConstVal, IntPtrTy)); + yyval.ConstVal = ConstantExpr::getCast(yyval.ConstVal, yyvsp[-3].ConstVal->getType()); } CHECK_FOR_ERROR - ;} - break; - - case 121: -#line 1711 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((yyvsp[-3].ConstVal)->getType() != (yyvsp[-1].ConstVal)->getType()) + ; + break;} +case 120: +#line 1711 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType()) GEN_ERROR("Logical operator types must match!"); - if (!(yyvsp[-3].ConstVal)->getType()->isIntegral()) { - if (!isa<PackedType>((yyvsp[-3].ConstVal)->getType()) || - !cast<PackedType>((yyvsp[-3].ConstVal)->getType())->getElementType()->isIntegral()) + if (!yyvsp[-3].ConstVal->getType()->isIntegral()) { + if (!isa<PackedType>(yyvsp[-3].ConstVal->getType()) || + !cast<PackedType>(yyvsp[-3].ConstVal->getType())->getElementType()->isIntegral()) GEN_ERROR("Logical operator requires integral operands!"); } - (yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].BinaryOpVal).opcode, (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); + yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal.opcode, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); CHECK_FOR_ERROR - ;} - break; - - case 122: -#line 1722 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((yyvsp[-3].ConstVal)->getType() != (yyvsp[-1].ConstVal)->getType()) + ; + break;} +case 121: +#line 1722 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType()) GEN_ERROR("setcc operand types must match!"); - (yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].BinaryOpVal).opcode, (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); + yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal.opcode, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); CHECK_FOR_ERROR - ;} - break; - - case 123: -#line 1728 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((yyvsp[-1].ConstVal)->getType() != Type::UByteTy) + ; + break;} +case 122: +#line 1728 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (yyvsp[-1].ConstVal->getType() != Type::UByteTy) GEN_ERROR("Shift count for shift constant must be unsigned byte!"); - if (!(yyvsp[-3].ConstVal)->getType()->isInteger()) + if (!yyvsp[-3].ConstVal->getType()->isInteger()) GEN_ERROR("Shift constant expression requires integer operand!"); - (yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].OtherOpVal).opcode, (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); + yyval.ConstVal = ConstantExpr::get(yyvsp[-5].OtherOpVal.opcode, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); CHECK_FOR_ERROR - ;} - break; - - case 124: -#line 1736 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!ExtractElementInst::isValidOperands((yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal))) + ; + break;} +case 123: +#line 1736 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!ExtractElementInst::isValidOperands(yyvsp[-3].ConstVal, yyvsp[-1].ConstVal)) GEN_ERROR("Invalid extractelement operands!"); - (yyval.ConstVal) = ConstantExpr::getExtractElement((yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); + yyval.ConstVal = ConstantExpr::getExtractElement(yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); CHECK_FOR_ERROR - ;} - break; - - case 125: -#line 1742 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!InsertElementInst::isValidOperands((yyvsp[-5].ConstVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal))) + ; + break;} +case 124: +#line 1742 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!InsertElementInst::isValidOperands(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal)) GEN_ERROR("Invalid insertelement operands!"); - (yyval.ConstVal) = ConstantExpr::getInsertElement((yyvsp[-5].ConstVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); + yyval.ConstVal = ConstantExpr::getInsertElement(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); CHECK_FOR_ERROR - ;} - break; - - case 126: -#line 1748 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!ShuffleVectorInst::isValidOperands((yyvsp[-5].ConstVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal))) + ; + break;} +case 125: +#line 1748 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!ShuffleVectorInst::isValidOperands(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal)) GEN_ERROR("Invalid shufflevector operands!"); - (yyval.ConstVal) = ConstantExpr::getShuffleVector((yyvsp[-5].ConstVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); - CHECK_FOR_ERROR - ;} - break; - - case 127: -#line 1757 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - ((yyval.ConstVector) = (yyvsp[-2].ConstVector))->push_back((yyvsp[0].ConstVal)); + yyval.ConstVal = ConstantExpr::getShuffleVector(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); CHECK_FOR_ERROR - ;} - break; - - case 128: -#line 1761 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ConstVector) = new std::vector<Constant*>(); - (yyval.ConstVector)->push_back((yyvsp[0].ConstVal)); + ; + break;} +case 126: +#line 1757 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + (yyval.ConstVector = yyvsp[-2].ConstVector)->push_back(yyvsp[0].ConstVal); CHECK_FOR_ERROR - ;} - break; - - case 129: -#line 1769 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.BoolVal) = false; ;} - break; - - case 130: -#line 1769 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.BoolVal) = true; ;} - break; - - case 131: -#line 1779 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ModuleVal) = ParserResult = (yyvsp[0].ModuleVal); + ; + break;} +case 127: +#line 1761 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ConstVector = new std::vector<Constant*>(); + yyval.ConstVector->push_back(yyvsp[0].ConstVal); + CHECK_FOR_ERROR + ; + break;} +case 128: +#line 1769 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.BoolVal = false; ; + break;} +case 129: +#line 1769 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.BoolVal = true; ; + break;} +case 130: +#line 1779 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ModuleVal = ParserResult = yyvsp[0].ModuleVal; CurModule.ModuleDone(); CHECK_FOR_ERROR; -;} - break; - - case 132: -#line 1787 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ModuleVal) = (yyvsp[-1].ModuleVal); +; + break;} +case 131: +#line 1787 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ModuleVal = yyvsp[-1].ModuleVal; CurFun.FunctionDone(); CHECK_FOR_ERROR - ;} - break; - - case 133: -#line 1792 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ModuleVal) = (yyvsp[-1].ModuleVal); + ; + break;} +case 132: +#line 1792 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ModuleVal = yyvsp[-1].ModuleVal; CHECK_FOR_ERROR - ;} - break; - - case 134: -#line 1796 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ModuleVal) = (yyvsp[-3].ModuleVal); + ; + break;} +case 133: +#line 1796 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ModuleVal = yyvsp[-3].ModuleVal; CHECK_FOR_ERROR - ;} - break; - - case 135: -#line 1800 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ModuleVal) = (yyvsp[-1].ModuleVal); + ; + break;} +case 134: +#line 1800 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ModuleVal = yyvsp[-1].ModuleVal; CHECK_FOR_ERROR - ;} - break; - - case 136: -#line 1804 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ModuleVal) = CurModule.CurrentModule; + ; + break;} +case 135: +#line 1804 "/Users/sabre/cvs/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; @@ -3942,12 +3263,11 @@ yyreduce: } } CHECK_FOR_ERROR - ;} - break; - - case 137: -#line 1819 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + ; + break;} +case 136: +#line 1819 "/Users/sabre/cvs/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: // @@ -3957,304 +3277,272 @@ yyreduce: // 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)); + ResolveTypeTo(yyvsp[-2].StrVal, *yyvsp[0].TypeVal); - if (!setTypeName(*(yyvsp[0].TypeVal), (yyvsp[-2].StrVal)) && !(yyvsp[-2].StrVal)) { + if (!setTypeName(*yyvsp[0].TypeVal, yyvsp[-2].StrVal) && !yyvsp[-2].StrVal) { CHECK_FOR_ERROR // If this is a named type that is not a redefinition, add it to the slot // table. - CurModule.Types.push_back(*(yyvsp[0].TypeVal)); + CurModule.Types.push_back(*yyvsp[0].TypeVal); } - delete (yyvsp[0].TypeVal); + delete yyvsp[0].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 138: -#line 1841 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Function prototypes can be in const pool + ; + break;} +case 137: +#line 1841 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Function prototypes can be in const pool CHECK_FOR_ERROR - ;} - break; - - case 139: -#line 1844 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Asm blocks can be in the const pool + ; + break;} +case 138: +#line 1844 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Asm blocks can be in the const pool CHECK_FOR_ERROR - ;} - break; - - case 140: -#line 1847 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((yyvsp[0].ConstVal) == 0) + ; + break;} +case 139: +#line 1847 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (yyvsp[0].ConstVal == 0) GEN_ERROR("Global value initializer is not a constant!"); - CurGV = ParseGlobalVariable((yyvsp[-3].StrVal), (yyvsp[-2].Linkage), (yyvsp[-1].BoolVal), (yyvsp[0].ConstVal)->getType(), (yyvsp[0].ConstVal)); + CurGV = ParseGlobalVariable(yyvsp[-3].StrVal, yyvsp[-2].Linkage, yyvsp[-1].BoolVal, yyvsp[0].ConstVal->getType(), yyvsp[0].ConstVal); CHECK_FOR_ERROR - ;} - break; - - case 141: -#line 1852 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + ; + break;} +case 140: +#line 1852 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ CurGV = 0; - ;} - break; - - case 142: -#line 1855 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - CurGV = ParseGlobalVariable((yyvsp[-3].StrVal), GlobalValue::ExternalLinkage, (yyvsp[-1].BoolVal), *(yyvsp[0].TypeVal), 0); + ; + break;} +case 141: +#line 1855 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + CurGV = ParseGlobalVariable(yyvsp[-3].StrVal, GlobalValue::ExternalLinkage, yyvsp[-1].BoolVal, *yyvsp[0].TypeVal, 0); CHECK_FOR_ERROR - delete (yyvsp[0].TypeVal); - ;} - break; - - case 143: -#line 1859 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + delete yyvsp[0].TypeVal; + ; + break;} +case 142: +#line 1859 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ CurGV = 0; CHECK_FOR_ERROR - ;} - break; - - case 144: -#line 1863 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - CurGV = ParseGlobalVariable((yyvsp[-3].StrVal), GlobalValue::DLLImportLinkage, (yyvsp[-1].BoolVal), *(yyvsp[0].TypeVal), 0); + ; + break;} +case 143: +#line 1863 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + CurGV = ParseGlobalVariable(yyvsp[-3].StrVal, GlobalValue::DLLImportLinkage, yyvsp[-1].BoolVal, *yyvsp[0].TypeVal, 0); CHECK_FOR_ERROR - delete (yyvsp[0].TypeVal); - ;} - break; - - case 145: -#line 1867 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + delete yyvsp[0].TypeVal; + ; + break;} +case 144: +#line 1867 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ CurGV = 0; CHECK_FOR_ERROR - ;} - break; - - case 146: -#line 1871 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + ; + break;} +case 145: +#line 1871 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ CurGV = - ParseGlobalVariable((yyvsp[-3].StrVal), GlobalValue::ExternalWeakLinkage, (yyvsp[-1].BoolVal), *(yyvsp[0].TypeVal), 0); + ParseGlobalVariable(yyvsp[-3].StrVal, GlobalValue::ExternalWeakLinkage, yyvsp[-1].BoolVal, *yyvsp[0].TypeVal, 0); CHECK_FOR_ERROR - delete (yyvsp[0].TypeVal); - ;} - break; - - case 147: -#line 1876 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + delete yyvsp[0].TypeVal; + ; + break;} +case 146: +#line 1876 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ CurGV = 0; CHECK_FOR_ERROR - ;} - break; - - case 148: -#line 1880 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + ; + break;} +case 147: +#line 1880 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ CHECK_FOR_ERROR - ;} - break; - - case 149: -#line 1883 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + ; + break;} +case 148: +#line 1883 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ CHECK_FOR_ERROR - ;} - break; - - case 150: -#line 1886 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - ;} - break; - - case 151: -#line 1890 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + ; + break;} +case 149: +#line 1886 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + ; + break;} +case 150: +#line 1890 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm(); - char *EndStr = UnEscapeLexed((yyvsp[0].StrVal), true); - std::string NewAsm((yyvsp[0].StrVal), EndStr); - free((yyvsp[0].StrVal)); + char *EndStr = UnEscapeLexed(yyvsp[0].StrVal, true); + std::string NewAsm(yyvsp[0].StrVal, EndStr); + free(yyvsp[0].StrVal); if (AsmSoFar.empty()) CurModule.CurrentModule->setModuleInlineAsm(NewAsm); else CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+NewAsm); CHECK_FOR_ERROR -;} - break; - - case 152: -#line 1903 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.Endianness) = Module::BigEndian; ;} - break; - - case 153: -#line 1904 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.Endianness) = Module::LittleEndian; ;} - break; - - case 154: -#line 1906 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - CurModule.CurrentModule->setEndianness((yyvsp[0].Endianness)); +; + break;} +case 151: +#line 1903 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.Endianness = Module::BigEndian; ; + break;} +case 152: +#line 1904 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.Endianness = Module::LittleEndian; ; + break;} +case 153: +#line 1906 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + CurModule.CurrentModule->setEndianness(yyvsp[0].Endianness); CHECK_FOR_ERROR - ;} - break; - - case 155: -#line 1910 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((yyvsp[0].UInt64Val) == 32) + ; + break;} +case 154: +#line 1910 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (yyvsp[0].UInt64Val == 32) CurModule.CurrentModule->setPointerSize(Module::Pointer32); - else if ((yyvsp[0].UInt64Val) == 64) + else if (yyvsp[0].UInt64Val == 64) CurModule.CurrentModule->setPointerSize(Module::Pointer64); else - GEN_ERROR("Invalid pointer size: '" + utostr((yyvsp[0].UInt64Val)) + "'!"); + GEN_ERROR("Invalid pointer size: '" + utostr(yyvsp[0].UInt64Val) + "'!"); CHECK_FOR_ERROR - ;} - break; - - case 156: -#line 1919 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - CurModule.CurrentModule->setTargetTriple((yyvsp[0].StrVal)); - free((yyvsp[0].StrVal)); - ;} - break; - - case 157: -#line 1923 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - CurModule.CurrentModule->setDataLayout((yyvsp[0].StrVal)); - free((yyvsp[0].StrVal)); - ;} - break; - - case 159: -#line 1930 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - CurModule.CurrentModule->addLibrary((yyvsp[0].StrVal)); - free((yyvsp[0].StrVal)); + ; + break;} +case 155: +#line 1919 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + CurModule.CurrentModule->setTargetTriple(yyvsp[0].StrVal); + free(yyvsp[0].StrVal); + ; + break;} +case 156: +#line 1923 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + CurModule.CurrentModule->setDataLayout(yyvsp[0].StrVal); + free(yyvsp[0].StrVal); + ; + break;} +case 158: +#line 1930 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal); + free(yyvsp[0].StrVal); CHECK_FOR_ERROR - ;} - break; - - case 160: -#line 1935 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - CurModule.CurrentModule->addLibrary((yyvsp[0].StrVal)); - free((yyvsp[0].StrVal)); + ; + break;} +case 159: +#line 1935 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal); + free(yyvsp[0].StrVal); CHECK_FOR_ERROR - ;} - break; - - case 161: -#line 1940 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + ; + break;} +case 160: +#line 1940 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ CHECK_FOR_ERROR - ;} - break; - - case 165: -#line 1950 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.StrVal) = 0; ;} - break; - - case 166: -#line 1952 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (*(yyvsp[-1].TypeVal) == Type::VoidTy) + ; + break;} +case 164: +#line 1950 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.StrVal = 0; ; + break;} +case 165: +#line 1952 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (*yyvsp[-1].TypeVal == Type::VoidTy) GEN_ERROR("void typed arguments are invalid!"); - (yyval.ArgVal) = new std::pair<PATypeHolder*, char*>((yyvsp[-1].TypeVal), (yyvsp[0].StrVal)); + yyval.ArgVal = new std::pair<PATypeHolder*, char*>(yyvsp[-1].TypeVal, yyvsp[0].StrVal); CHECK_FOR_ERROR -;} - break; - - case 167: -#line 1959 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ArgList) = (yyvsp[-2].ArgList); - (yyvsp[-2].ArgList)->push_back(*(yyvsp[0].ArgVal)); - delete (yyvsp[0].ArgVal); - CHECK_FOR_ERROR - ;} - break; - - case 168: -#line 1965 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ArgList) = new std::vector<std::pair<PATypeHolder*,char*> >(); - (yyval.ArgList)->push_back(*(yyvsp[0].ArgVal)); - delete (yyvsp[0].ArgVal); - CHECK_FOR_ERROR - ;} - break; - - case 169: -#line 1972 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ArgList) = (yyvsp[0].ArgList); +; + break;} +case 166: +#line 1959 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ArgList = yyvsp[-2].ArgList; + yyvsp[-2].ArgList->push_back(*yyvsp[0].ArgVal); + delete yyvsp[0].ArgVal; + CHECK_FOR_ERROR + ; + break;} +case 167: +#line 1965 "/Users/sabre/cvs/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; + CHECK_FOR_ERROR + ; + break;} +case 168: +#line 1972 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ArgList = yyvsp[0].ArgList; CHECK_FOR_ERROR - ;} - break; - - case 170: -#line 1976 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ArgList) = (yyvsp[-2].ArgList); - (yyval.ArgList)->push_back(std::pair<PATypeHolder*, + ; + break;} +case 169: +#line 1976 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ArgList = yyvsp[-2].ArgList; + yyval.ArgList->push_back(std::pair<PATypeHolder*, char*>(new PATypeHolder(Type::VoidTy), 0)); CHECK_FOR_ERROR - ;} - break; - - case 171: -#line 1982 "/proj/llvm/llvm-4/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 170: +#line 1982 "/Users/sabre/cvs/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)); CHECK_FOR_ERROR - ;} - break; - - case 172: -#line 1987 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ArgList) = 0; + ; + break;} +case 171: +#line 1987 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ArgList = 0; CHECK_FOR_ERROR - ;} - break; - - case 173: -#line 1993 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - UnEscapeLexed((yyvsp[-5].StrVal)); - std::string FunctionName((yyvsp[-5].StrVal)); - free((yyvsp[-5].StrVal)); // Free strdup'd memory! + ; + break;} +case 172: +#line 1993 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + UnEscapeLexed(yyvsp[-5].StrVal); + std::string FunctionName(yyvsp[-5].StrVal); + free(yyvsp[-5].StrVal); // Free strdup'd memory! - if (!(*(yyvsp[-6].TypeVal))->isFirstClassType() && *(yyvsp[-6].TypeVal) != Type::VoidTy) + if (!(*yyvsp[-6].TypeVal)->isFirstClassType() && *yyvsp[-6].TypeVal != Type::VoidTy) GEN_ERROR("LLVM functions cannot return aggregate types!"); std::vector<const Type*> ParamTypeList; - if ((yyvsp[-3].ArgList)) { // If there are arguments... - for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = (yyvsp[-3].ArgList)->begin(); - I != (yyvsp[-3].ArgList)->end(); ++I) + if (yyvsp[-3].ArgList) { // If there are arguments... + for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = yyvsp[-3].ArgList->begin(); + I != yyvsp[-3].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[-6].TypeVal), ParamTypeList, isVarArg); + const FunctionType *FT = FunctionType::get(*yyvsp[-6].TypeVal, ParamTypeList, isVarArg); const PointerType *PFT = PointerType::get(FT); - delete (yyvsp[-6].TypeVal); + delete yyvsp[-6].TypeVal; ValID ID; if (!FunctionName.empty()) { @@ -4298,24 +3586,24 @@ yyreduce: // another function. Fn->setLinkage(CurFun.Linkage); } - Fn->setCallingConv((yyvsp[-7].UIntVal)); - Fn->setAlignment((yyvsp[0].UIntVal)); - if ((yyvsp[-1].StrVal)) { - Fn->setSection((yyvsp[-1].StrVal)); - free((yyvsp[-1].StrVal)); + Fn->setCallingConv(yyvsp[-7].UIntVal); + Fn->setAlignment(yyvsp[0].UIntVal); + if (yyvsp[-1].StrVal) { + Fn->setSection(yyvsp[-1].StrVal); + free(yyvsp[-1].StrVal); } // Add all of the arguments we parsed to the function... - if ((yyvsp[-3].ArgList)) { // Is null if empty... + if (yyvsp[-3].ArgList) { // Is null if empty... if (isVarArg) { // Nuke the last entry - assert((yyvsp[-3].ArgList)->back().first->get() == Type::VoidTy && (yyvsp[-3].ArgList)->back().second == 0&& + assert(yyvsp[-3].ArgList->back().first->get() == Type::VoidTy && yyvsp[-3].ArgList->back().second == 0&& "Not a varargs marker!"); - delete (yyvsp[-3].ArgList)->back().first; - (yyvsp[-3].ArgList)->pop_back(); // Delete the last entry + delete yyvsp[-3].ArgList->back().first; + yyvsp[-3].ArgList->pop_back(); // Delete the last entry } Function::arg_iterator ArgIt = Fn->arg_begin(); - for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = (yyvsp[-3].ArgList)->begin(); - I != (yyvsp[-3].ArgList)->end(); ++I, ++ArgIt) { + for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = yyvsp[-3].ArgList->begin(); + I != yyvsp[-3].ArgList->end(); ++I, ++ArgIt) { delete I->first; // Delete the typeholder... setValueName(ArgIt, I->second); // Insert arg into symtab... @@ -4323,140 +3611,123 @@ yyreduce: InsertValue(ArgIt); } - delete (yyvsp[-3].ArgList); // We're now done with the argument list + delete yyvsp[-3].ArgList; // We're now done with the argument list } CHECK_FOR_ERROR -;} - break; - - case 176: -#line 2089 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.FunctionVal) = CurFun.CurrentFunction; +; + break;} +case 175: +#line 2089 "/Users/sabre/cvs/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 179: -#line 2099 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.FunctionVal) = (yyvsp[-1].FunctionVal); + yyval.FunctionVal->setLinkage(yyvsp[-2].Linkage); +; + break;} +case 178: +#line 2099 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.FunctionVal = yyvsp[-1].FunctionVal; CHECK_FOR_ERROR -;} - break; - - case 181: -#line 2105 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { CurFun.Linkage = GlobalValue::DLLImportLinkage ;} - break; - - case 182: -#line 2106 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { CurFun.Linkage = GlobalValue::DLLImportLinkage ;} - break; - - case 183: -#line 2108 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { CurFun.isDeclare = true; ;} - break; - - case 184: -#line 2108 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.FunctionVal) = CurFun.CurrentFunction; +; + break;} +case 180: +#line 2105 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ CurFun.Linkage = GlobalValue::DLLImportLinkage; ; + break;} +case 181: +#line 2106 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ CurFun.Linkage = GlobalValue::DLLImportLinkage; ; + break;} +case 182: +#line 2108 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ CurFun.isDeclare = true; ; + break;} +case 183: +#line 2108 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.FunctionVal = CurFun.CurrentFunction; CurFun.FunctionDone(); CHECK_FOR_ERROR - ;} - break; - - case 185: -#line 2118 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.BoolVal) = false; - CHECK_FOR_ERROR - ;} - break; - - case 186: -#line 2122 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.BoolVal) = true; - CHECK_FOR_ERROR - ;} - break; - - case 187: -#line 2127 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // A reference to a direct constant - (yyval.ValIDVal) = ValID::create((yyvsp[0].SInt64Val)); - CHECK_FOR_ERROR - ;} - break; - - case 188: -#line 2131 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ValIDVal) = ValID::create((yyvsp[0].UInt64Val)); - CHECK_FOR_ERROR - ;} - break; - - case 189: -#line 2135 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Perhaps it's an FP constant? - (yyval.ValIDVal) = ValID::create((yyvsp[0].FPVal)); - CHECK_FOR_ERROR - ;} - break; - - case 190: -#line 2139 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ValIDVal) = ValID::create(ConstantBool::getTrue()); - CHECK_FOR_ERROR - ;} - break; - - case 191: -#line 2143 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ValIDVal) = ValID::create(ConstantBool::getFalse()); + ; + break;} +case 184: +#line 2118 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.BoolVal = false; CHECK_FOR_ERROR - ;} - break; - - case 192: -#line 2147 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ValIDVal) = ValID::createNull(); + ; + break;} +case 185: +#line 2122 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.BoolVal = true; + CHECK_FOR_ERROR + ; + break;} +case 186: +#line 2127 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // A reference to a direct constant + yyval.ValIDVal = ValID::create(yyvsp[0].SInt64Val); + CHECK_FOR_ERROR + ; + break;} +case 187: +#line 2131 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ValIDVal = ValID::create(yyvsp[0].UInt64Val); + CHECK_FOR_ERROR + ; + break;} +case 188: +#line 2135 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Perhaps it's an FP constant? + yyval.ValIDVal = ValID::create(yyvsp[0].FPVal); + CHECK_FOR_ERROR + ; + break;} +case 189: +#line 2139 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ValIDVal = ValID::create(ConstantBool::getTrue()); CHECK_FOR_ERROR - ;} - break; - - case 193: -#line 2151 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ValIDVal) = ValID::createUndef(); + ; + break;} +case 190: +#line 2143 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ValIDVal = ValID::create(ConstantBool::getFalse()); CHECK_FOR_ERROR - ;} - break; - - case 194: -#line 2155 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // A vector zero constant. - (yyval.ValIDVal) = ValID::createZeroInit(); + ; + break;} +case 191: +#line 2147 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ValIDVal = ValID::createNull(); CHECK_FOR_ERROR - ;} - break; - - case 195: -#line 2159 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Nonempty unsized packed vector - const Type *ETy = (*(yyvsp[-1].ConstVector))[0]->getType(); - int NumElements = (yyvsp[-1].ConstVector)->size(); + ; + break;} +case 192: +#line 2151 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ValIDVal = ValID::createUndef(); + CHECK_FOR_ERROR + ; + break;} +case 193: +#line 2155 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // A vector zero constant. + yyval.ValIDVal = ValID::createZeroInit(); + CHECK_FOR_ERROR + ; + break;} +case 194: +#line 2159 "/Users/sabre/cvs/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( @@ -4468,108 +3739,98 @@ yyreduce: ); // Verify all elements are correct type! - for (unsigned i = 0; i < (yyvsp[-1].ConstVector)->size(); i++) { - if (ETy != (*(yyvsp[-1].ConstVector))[i]->getType()) + for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) { + if (ETy != (*yyvsp[-1].ConstVector)[i]->getType()) GEN_ERROR("Element #" + utostr(i) + " is not of type '" + ETy->getDescription() +"' as required!\nIt is of type '" + - (*(yyvsp[-1].ConstVector))[i]->getType()->getDescription() + "'."); + (*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'."); } - (yyval.ValIDVal) = ValID::create(ConstantPacked::get(pt, *(yyvsp[-1].ConstVector))); - delete PTy; delete (yyvsp[-1].ConstVector); - CHECK_FOR_ERROR - ;} - break; - - case 196: -#line 2184 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ValIDVal) = ValID::create((yyvsp[0].ConstVal)); - CHECK_FOR_ERROR - ;} - break; - - case 197: -#line 2188 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - char *End = UnEscapeLexed((yyvsp[-2].StrVal), true); - std::string AsmStr = std::string((yyvsp[-2].StrVal), End); - End = UnEscapeLexed((yyvsp[0].StrVal), true); - std::string Constraints = std::string((yyvsp[0].StrVal), End); - (yyval.ValIDVal) = ValID::createInlineAsm(AsmStr, Constraints, (yyvsp[-3].BoolVal)); - free((yyvsp[-2].StrVal)); - free((yyvsp[0].StrVal)); - CHECK_FOR_ERROR - ;} - break; - - case 198: -#line 2202 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Is it an integer reference...? - (yyval.ValIDVal) = ValID::create((yyvsp[0].SIntVal)); + yyval.ValIDVal = ValID::create(ConstantPacked::get(pt, *yyvsp[-1].ConstVector)); + delete PTy; delete yyvsp[-1].ConstVector; CHECK_FOR_ERROR - ;} - break; - - case 199: -#line 2206 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Is it a named reference...? - (yyval.ValIDVal) = ValID::create((yyvsp[0].StrVal)); - CHECK_FOR_ERROR - ;} - break; - - case 202: -#line 2218 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ValueVal) = getVal(*(yyvsp[-1].TypeVal), (yyvsp[0].ValIDVal)); delete (yyvsp[-1].TypeVal); - CHECK_FOR_ERROR - ;} - break; - - case 203: -#line 2223 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.FunctionVal) = (yyvsp[-1].FunctionVal); + ; + break;} +case 195: +#line 2184 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ValIDVal = ValID::create(yyvsp[0].ConstVal); CHECK_FOR_ERROR - ;} - break; - - case 204: -#line 2227 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Do not allow functions with 0 basic blocks - (yyval.FunctionVal) = (yyvsp[-1].FunctionVal); + ; + break;} +case 196: +#line 2188 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + char *End = UnEscapeLexed(yyvsp[-2].StrVal, true); + std::string AsmStr = std::string(yyvsp[-2].StrVal, End); + End = UnEscapeLexed(yyvsp[0].StrVal, true); + std::string Constraints = std::string(yyvsp[0].StrVal, End); + yyval.ValIDVal = ValID::createInlineAsm(AsmStr, Constraints, yyvsp[-3].BoolVal); + free(yyvsp[-2].StrVal); + free(yyvsp[0].StrVal); + CHECK_FOR_ERROR + ; + break;} +case 197: +#line 2202 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Is it an integer reference...? + yyval.ValIDVal = ValID::create(yyvsp[0].SIntVal); + CHECK_FOR_ERROR + ; + break;} +case 198: +#line 2206 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Is it a named reference...? + yyval.ValIDVal = ValID::create(yyvsp[0].StrVal); + CHECK_FOR_ERROR + ; + break;} +case 201: +#line 2218 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ValueVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal); delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 205: -#line 2236 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - setValueName((yyvsp[0].TermInstVal), (yyvsp[-1].StrVal)); + ; + break;} +case 202: +#line 2223 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.FunctionVal = yyvsp[-1].FunctionVal; + CHECK_FOR_ERROR + ; + break;} +case 203: +#line 2227 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Do not allow functions with 0 basic blocks + yyval.FunctionVal = yyvsp[-1].FunctionVal; + CHECK_FOR_ERROR + ; + break;} +case 204: +#line 2236 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + setValueName(yyvsp[0].TermInstVal, yyvsp[-1].StrVal); CHECK_FOR_ERROR - InsertValue((yyvsp[0].TermInstVal)); + InsertValue(yyvsp[0].TermInstVal); - (yyvsp[-2].BasicBlockVal)->getInstList().push_back((yyvsp[0].TermInstVal)); - InsertValue((yyvsp[-2].BasicBlockVal)); - (yyval.BasicBlockVal) = (yyvsp[-2].BasicBlockVal); + yyvsp[-2].BasicBlockVal->getInstList().push_back(yyvsp[0].TermInstVal); + InsertValue(yyvsp[-2].BasicBlockVal); + yyval.BasicBlockVal = yyvsp[-2].BasicBlockVal; CHECK_FOR_ERROR - ;} - break; - - case 206: -#line 2247 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyvsp[-1].BasicBlockVal)->getInstList().push_back((yyvsp[0].InstVal)); - (yyval.BasicBlockVal) = (yyvsp[-1].BasicBlockVal); + ; + break;} +case 205: +#line 2247 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyvsp[-1].BasicBlockVal->getInstList().push_back(yyvsp[0].InstVal); + yyval.BasicBlockVal = yyvsp[-1].BasicBlockVal; CHECK_FOR_ERROR - ;} - break; - - case 207: -#line 2252 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.BasicBlockVal) = CurBB = getBBVal(ValID::create((int)CurFun.NextBBNum++), true); + ; + break;} +case 206: +#line 2252 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.BasicBlockVal = CurBB = getBBVal(ValID::create((int)CurFun.NextBBNum++), true); CHECK_FOR_ERROR // Make sure to move the basic block to the correct location in the @@ -4577,15 +3838,14 @@ yyreduce: // referenced. Function::BasicBlockListType &BBL = CurFun.CurrentFunction->getBasicBlockList(); - BBL.splice(BBL.end(), BBL, (yyval.BasicBlockVal)); + BBL.splice(BBL.end(), BBL, yyval.BasicBlockVal); CHECK_FOR_ERROR - ;} - break; - - case 208: -#line 2264 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.BasicBlockVal) = CurBB = getBBVal(ValID::create((yyvsp[0].StrVal)), true); + ; + break;} +case 207: +#line 2264 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.BasicBlockVal = CurBB = getBBVal(ValID::create(yyvsp[0].StrVal), true); CHECK_FOR_ERROR // Make sure to move the basic block to the correct location in the @@ -4593,97 +3853,90 @@ yyreduce: // referenced. Function::BasicBlockListType &BBL = CurFun.CurrentFunction->getBasicBlockList(); - BBL.splice(BBL.end(), BBL, (yyval.BasicBlockVal)); - CHECK_FOR_ERROR - ;} - break; - - case 209: -#line 2277 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Return with a result... - (yyval.TermInstVal) = new ReturnInst((yyvsp[0].ValueVal)); - CHECK_FOR_ERROR - ;} - break; - - case 210: -#line 2281 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Return with no result... - (yyval.TermInstVal) = new ReturnInst(); - CHECK_FOR_ERROR - ;} - break; - - case 211: -#line 2285 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Unconditional Branch... - BasicBlock* tmpBB = getBBVal((yyvsp[0].ValIDVal)); - CHECK_FOR_ERROR - (yyval.TermInstVal) = new BranchInst(tmpBB); - ;} - break; - - case 212: -#line 2290 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - BasicBlock* tmpBBA = getBBVal((yyvsp[-3].ValIDVal)); - CHECK_FOR_ERROR - BasicBlock* tmpBBB = getBBVal((yyvsp[0].ValIDVal)); - CHECK_FOR_ERROR - Value* tmpVal = getVal(Type::BoolTy, (yyvsp[-6].ValIDVal)); - CHECK_FOR_ERROR - (yyval.TermInstVal) = new BranchInst(tmpBBA, tmpBBB, tmpVal); - ;} - break; - - case 213: -#line 2299 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - Value* tmpVal = getVal((yyvsp[-7].PrimType), (yyvsp[-6].ValIDVal)); + BBL.splice(BBL.end(), BBL, yyval.BasicBlockVal); + CHECK_FOR_ERROR + ; + break;} +case 208: +#line 2277 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Return with a result... + yyval.TermInstVal = new ReturnInst(yyvsp[0].ValueVal); + CHECK_FOR_ERROR + ; + break;} +case 209: +#line 2281 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Return with no result... + yyval.TermInstVal = new ReturnInst(); + CHECK_FOR_ERROR + ; + break;} +case 210: +#line 2285 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Unconditional Branch... + BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal); + CHECK_FOR_ERROR + yyval.TermInstVal = new BranchInst(tmpBB); + ; + break;} +case 211: +#line 2290 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + BasicBlock* tmpBBA = getBBVal(yyvsp[-3].ValIDVal); + CHECK_FOR_ERROR + BasicBlock* tmpBBB = getBBVal(yyvsp[0].ValIDVal); + CHECK_FOR_ERROR + Value* tmpVal = getVal(Type::BoolTy, yyvsp[-6].ValIDVal); + CHECK_FOR_ERROR + yyval.TermInstVal = new BranchInst(tmpBBA, tmpBBB, tmpVal); + ; + break;} +case 212: +#line 2299 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + Value* tmpVal = getVal(yyvsp[-7].PrimType, yyvsp[-6].ValIDVal); CHECK_FOR_ERROR - BasicBlock* tmpBB = getBBVal((yyvsp[-3].ValIDVal)); + BasicBlock* tmpBB = getBBVal(yyvsp[-3].ValIDVal); CHECK_FOR_ERROR - SwitchInst *S = new SwitchInst(tmpVal, tmpBB, (yyvsp[-1].JumpTable)->size()); - (yyval.TermInstVal) = S; + SwitchInst *S = new SwitchInst(tmpVal, tmpBB, yyvsp[-1].JumpTable->size()); + yyval.TermInstVal = S; - std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = (yyvsp[-1].JumpTable)->begin(), - E = (yyvsp[-1].JumpTable)->end(); + 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 GEN_ERROR("Switch case is constant, but not a simple integer!"); } - delete (yyvsp[-1].JumpTable); + delete yyvsp[-1].JumpTable; CHECK_FOR_ERROR - ;} - break; - - case 214: -#line 2318 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - Value* tmpVal = getVal((yyvsp[-6].PrimType), (yyvsp[-5].ValIDVal)); + ; + break;} +case 213: +#line 2318 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + Value* tmpVal = getVal(yyvsp[-6].PrimType, yyvsp[-5].ValIDVal); CHECK_FOR_ERROR - BasicBlock* tmpBB = getBBVal((yyvsp[-2].ValIDVal)); + BasicBlock* tmpBB = getBBVal(yyvsp[-2].ValIDVal); CHECK_FOR_ERROR SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0); - (yyval.TermInstVal) = S; + yyval.TermInstVal = S; CHECK_FOR_ERROR - ;} - break; - - case 215: -#line 2328 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + ; + break;} +case 214: +#line 2328 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ const PointerType *PFTy; const FunctionType *Ty; - if (!(PFTy = dyn_cast<PointerType>((yyvsp[-10].TypeVal)->get())) || + 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(); + 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()); } @@ -4691,27 +3944,27 @@ yyreduce: bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy; if (isVarArg) ParamTypes.pop_back(); - Ty = FunctionType::get((yyvsp[-10].TypeVal)->get(), ParamTypes, isVarArg); + 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... + Value *V = getVal(PFTy, yyvsp[-9].ValIDVal); // Get the function we're calling... CHECK_FOR_ERROR - BasicBlock *Normal = getBBVal((yyvsp[-3].ValIDVal)); + BasicBlock *Normal = getBBVal(yyvsp[-3].ValIDVal); CHECK_FOR_ERROR - BasicBlock *Except = getBBVal((yyvsp[0].ValIDVal)); + BasicBlock *Except = getBBVal(yyvsp[0].ValIDVal); CHECK_FOR_ERROR // Create the call node... - if (!(yyvsp[-7].ValueList)) { // Has no arguments? - (yyval.TermInstVal) = new InvokeInst(V, Normal, Except, std::vector<Value*>()); + 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(); + 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) @@ -4721,269 +3974,248 @@ yyreduce: if (I != E || (ArgI != ArgE && !Ty->isVarArg())) GEN_ERROR("Invalid number of parameters detected!"); - (yyval.TermInstVal) = new InvokeInst(V, Normal, Except, *(yyvsp[-7].ValueList)); + yyval.TermInstVal = new InvokeInst(V, Normal, Except, *yyvsp[-7].ValueList); } - cast<InvokeInst>((yyval.TermInstVal))->setCallingConv((yyvsp[-11].UIntVal)); + cast<InvokeInst>(yyval.TermInstVal)->setCallingConv(yyvsp[-11].UIntVal); - delete (yyvsp[-10].TypeVal); - delete (yyvsp[-7].ValueList); + delete yyvsp[-10].TypeVal; + delete yyvsp[-7].ValueList; CHECK_FOR_ERROR - ;} - break; - - case 216: -#line 2383 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.TermInstVal) = new UnwindInst(); + ; + break;} +case 215: +#line 2383 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.TermInstVal = new UnwindInst(); CHECK_FOR_ERROR - ;} - break; - - case 217: -#line 2387 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.TermInstVal) = new UnreachableInst(); + ; + break;} +case 216: +#line 2387 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.TermInstVal = new UnreachableInst(); CHECK_FOR_ERROR - ;} - break; - - case 218: -#line 2394 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.JumpTable) = (yyvsp[-5].JumpTable); - Constant *V = cast<Constant>(getValNonImprovising((yyvsp[-4].PrimType), (yyvsp[-3].ValIDVal))); + ; + break;} +case 217: +#line 2394 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.JumpTable = yyvsp[-5].JumpTable; + Constant *V = cast<Constant>(getValNonImprovising(yyvsp[-4].PrimType, yyvsp[-3].ValIDVal)); CHECK_FOR_ERROR if (V == 0) GEN_ERROR("May only switch on a constant pool value!"); - BasicBlock* tmpBB = getBBVal((yyvsp[0].ValIDVal)); + BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal); CHECK_FOR_ERROR - (yyval.JumpTable)->push_back(std::make_pair(V, tmpBB)); - ;} - break; - - case 219: -#line 2405 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.JumpTable) = new std::vector<std::pair<Constant*, BasicBlock*> >(); - Constant *V = cast<Constant>(getValNonImprovising((yyvsp[-4].PrimType), (yyvsp[-3].ValIDVal))); + yyval.JumpTable->push_back(std::make_pair(V, tmpBB)); + ; + break;} +case 218: +#line 2405 "/Users/sabre/cvs/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)); CHECK_FOR_ERROR if (V == 0) GEN_ERROR("May only switch on a constant pool value!"); - BasicBlock* tmpBB = getBBVal((yyvsp[0].ValIDVal)); + BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal); CHECK_FOR_ERROR - (yyval.JumpTable)->push_back(std::make_pair(V, tmpBB)); - ;} - break; - - case 220: -#line 2418 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + yyval.JumpTable->push_back(std::make_pair(V, tmpBB)); + ; + break;} +case 219: +#line 2418 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Is this definition named?? if so, assign the name... - setValueName((yyvsp[0].InstVal), (yyvsp[-1].StrVal)); + setValueName(yyvsp[0].InstVal, yyvsp[-1].StrVal); CHECK_FOR_ERROR - InsertValue((yyvsp[0].InstVal)); - (yyval.InstVal) = (yyvsp[0].InstVal); + InsertValue(yyvsp[0].InstVal); + yyval.InstVal = yyvsp[0].InstVal; CHECK_FOR_ERROR -;} - break; - - case 221: -#line 2427 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { // Used for PHI nodes - (yyval.PHIList) = new std::list<std::pair<Value*, BasicBlock*> >(); - Value* tmpVal = getVal(*(yyvsp[-5].TypeVal), (yyvsp[-3].ValIDVal)); - CHECK_FOR_ERROR - BasicBlock* tmpBB = getBBVal((yyvsp[-1].ValIDVal)); - CHECK_FOR_ERROR - (yyval.PHIList)->push_back(std::make_pair(tmpVal, tmpBB)); - delete (yyvsp[-5].TypeVal); - ;} - break; - - case 222: -#line 2436 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.PHIList) = (yyvsp[-6].PHIList); - Value* tmpVal = getVal((yyvsp[-6].PHIList)->front().first->getType(), (yyvsp[-3].ValIDVal)); - CHECK_FOR_ERROR - BasicBlock* tmpBB = getBBVal((yyvsp[-1].ValIDVal)); - CHECK_FOR_ERROR - (yyvsp[-6].PHIList)->push_back(std::make_pair(tmpVal, tmpBB)); - ;} - break; - - case 223: -#line 2446 "/proj/llvm/llvm-4/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 224: -#line 2450 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ValueList) = (yyvsp[-2].ValueList); - (yyvsp[-2].ValueList)->push_back((yyvsp[0].ValueVal)); - CHECK_FOR_ERROR - ;} - break; - - case 226: -#line 2457 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { (yyval.ValueList) = 0; ;} - break; - - case 227: -#line 2459 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.BoolVal) = true; +; + break;} +case 220: +#line 2427 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ // Used for PHI nodes + yyval.PHIList = new std::list<std::pair<Value*, BasicBlock*> >(); + Value* tmpVal = getVal(*yyvsp[-5].TypeVal, yyvsp[-3].ValIDVal); + CHECK_FOR_ERROR + BasicBlock* tmpBB = getBBVal(yyvsp[-1].ValIDVal); + CHECK_FOR_ERROR + yyval.PHIList->push_back(std::make_pair(tmpVal, tmpBB)); + delete yyvsp[-5].TypeVal; + ; + break;} +case 221: +#line 2436 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.PHIList = yyvsp[-6].PHIList; + Value* tmpVal = getVal(yyvsp[-6].PHIList->front().first->getType(), yyvsp[-3].ValIDVal); + CHECK_FOR_ERROR + BasicBlock* tmpBB = getBBVal(yyvsp[-1].ValIDVal); + CHECK_FOR_ERROR + yyvsp[-6].PHIList->push_back(std::make_pair(tmpVal, tmpBB)); + ; + break;} +case 222: +#line 2446 "/Users/sabre/cvs/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 223: +#line 2450 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ValueList = yyvsp[-2].ValueList; + yyvsp[-2].ValueList->push_back(yyvsp[0].ValueVal); + CHECK_FOR_ERROR + ; + break;} +case 225: +#line 2457 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ yyval.ValueList = 0; ; + break;} +case 226: +#line 2459 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.BoolVal = true; CHECK_FOR_ERROR - ;} - break; - - case 228: -#line 2463 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.BoolVal) = false; + ; + break;} +case 227: +#line 2463 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.BoolVal = false; CHECK_FOR_ERROR - ;} - break; - - case 229: -#line 2468 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!(*(yyvsp[-3].TypeVal))->isInteger() && !(*(yyvsp[-3].TypeVal))->isFloatingPoint() && - !isa<PackedType>((*(yyvsp[-3].TypeVal)).get())) + ; + break;} +case 228: +#line 2468 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!(*yyvsp[-3].TypeVal)->isInteger() && !(*yyvsp[-3].TypeVal)->isFloatingPoint() && + !isa<PackedType>((*yyvsp[-3].TypeVal).get())) GEN_ERROR( "Arithmetic operator requires integer, FP, or packed operands!"); - if (isa<PackedType>((*(yyvsp[-3].TypeVal)).get()) && - ((yyvsp[-4].BinaryOpVal).opcode == Instruction::URem || - (yyvsp[-4].BinaryOpVal).opcode == Instruction::SRem || - (yyvsp[-4].BinaryOpVal).opcode == Instruction::FRem)) + if (isa<PackedType>((*yyvsp[-3].TypeVal).get()) && + (yyvsp[-4].BinaryOpVal.opcode == Instruction::URem || + yyvsp[-4].BinaryOpVal.opcode == Instruction::SRem || + yyvsp[-4].BinaryOpVal.opcode == Instruction::FRem)) GEN_ERROR("U/S/FRem not supported on packed types!"); // Upgrade the opcode from obsolete versions before we do anything with it. - sanitizeOpCode((yyvsp[-4].BinaryOpVal),*(yyvsp[-3].TypeVal)); + sanitizeOpCode(yyvsp[-4].BinaryOpVal,*yyvsp[-3].TypeVal); CHECK_FOR_ERROR; - Value* val1 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[-2].ValIDVal)); + Value* val1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal); CHECK_FOR_ERROR - Value* val2 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[0].ValIDVal)); + Value* val2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal); CHECK_FOR_ERROR - (yyval.InstVal) = BinaryOperator::create((yyvsp[-4].BinaryOpVal).opcode, val1, val2); - if ((yyval.InstVal) == 0) + yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal.opcode, val1, val2); + if (yyval.InstVal == 0) GEN_ERROR("binary operator returned null!"); - delete (yyvsp[-3].TypeVal); - ;} - break; - - case 230: -#line 2490 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!(*(yyvsp[-3].TypeVal))->isIntegral()) { - if (!isa<PackedType>((yyvsp[-3].TypeVal)->get()) || - !cast<PackedType>((yyvsp[-3].TypeVal)->get())->getElementType()->isIntegral()) + delete yyvsp[-3].TypeVal; + ; + break;} +case 229: +#line 2490 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!(*yyvsp[-3].TypeVal)->isIntegral()) { + if (!isa<PackedType>(yyvsp[-3].TypeVal->get()) || + !cast<PackedType>(yyvsp[-3].TypeVal->get())->getElementType()->isIntegral()) GEN_ERROR("Logical operator requires integral operands!"); } - Value* tmpVal1 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[-2].ValIDVal)); + Value* tmpVal1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal); CHECK_FOR_ERROR - Value* tmpVal2 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[0].ValIDVal)); + Value* tmpVal2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal); CHECK_FOR_ERROR - (yyval.InstVal) = BinaryOperator::create((yyvsp[-4].BinaryOpVal).opcode, tmpVal1, tmpVal2); - if ((yyval.InstVal) == 0) + yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal.opcode, tmpVal1, tmpVal2); + if (yyval.InstVal == 0) GEN_ERROR("binary operator returned null!"); - delete (yyvsp[-3].TypeVal); - ;} - break; - - case 231: -#line 2505 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if(isa<PackedType>((*(yyvsp[-3].TypeVal)).get())) { + delete yyvsp[-3].TypeVal; + ; + break;} +case 230: +#line 2505 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if(isa<PackedType>((*yyvsp[-3].TypeVal).get())) { GEN_ERROR( "PackedTypes currently not supported in setcc instructions!"); } - Value* tmpVal1 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[-2].ValIDVal)); + Value* tmpVal1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal); CHECK_FOR_ERROR - Value* tmpVal2 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[0].ValIDVal)); + Value* tmpVal2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal); CHECK_FOR_ERROR - (yyval.InstVal) = new SetCondInst((yyvsp[-4].BinaryOpVal).opcode, tmpVal1, tmpVal2); - if ((yyval.InstVal) == 0) + yyval.InstVal = new SetCondInst(yyvsp[-4].BinaryOpVal.opcode, tmpVal1, tmpVal2); + if (yyval.InstVal == 0) GEN_ERROR("binary operator returned null!"); - delete (yyvsp[-3].TypeVal); - ;} - break; - - case 232: -#line 2519 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + delete yyvsp[-3].TypeVal; + ; + break;} +case 231: +#line 2519 "/Users/sabre/cvs/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()); + Value *Ones = ConstantIntegral::getAllOnesValue(yyvsp[0].ValueVal->getType()); if (Ones == 0) GEN_ERROR("Expected integral type for not instruction!"); - (yyval.InstVal) = BinaryOperator::create(Instruction::Xor, (yyvsp[0].ValueVal), Ones); - if ((yyval.InstVal) == 0) + yyval.InstVal = BinaryOperator::create(Instruction::Xor, yyvsp[0].ValueVal, Ones); + if (yyval.InstVal == 0) GEN_ERROR("Could not create a xor instruction!"); CHECK_FOR_ERROR - ;} - break; - - case 233: -#line 2532 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((yyvsp[0].ValueVal)->getType() != Type::UByteTy) + ; + break;} +case 232: +#line 2532 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (yyvsp[0].ValueVal->getType() != Type::UByteTy) GEN_ERROR("Shift amount must be ubyte!"); - if (!(yyvsp[-2].ValueVal)->getType()->isInteger()) + if (!yyvsp[-2].ValueVal->getType()->isInteger()) GEN_ERROR("Shift constant expression requires integer operand!"); - (yyval.InstVal) = new ShiftInst((yyvsp[-3].OtherOpVal).opcode, (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal)); + yyval.InstVal = new ShiftInst(yyvsp[-3].OtherOpVal.opcode, yyvsp[-2].ValueVal, yyvsp[0].ValueVal); CHECK_FOR_ERROR - ;} - break; - - case 234: -#line 2540 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!(yyvsp[0].TypeVal)->get()->isFirstClassType()) + ; + break;} +case 233: +#line 2540 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!yyvsp[0].TypeVal->get()->isFirstClassType()) GEN_ERROR("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); - CHECK_FOR_ERROR - ;} - break; - - case 235: -#line 2548 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if ((yyvsp[-4].ValueVal)->getType() != Type::BoolTy) + yyvsp[0].TypeVal->get()->getDescription() + "'!"); + yyval.InstVal = new CastInst(yyvsp[-2].ValueVal, *yyvsp[0].TypeVal); + delete yyvsp[0].TypeVal; + CHECK_FOR_ERROR + ; + break;} +case 234: +#line 2548 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (yyvsp[-4].ValueVal->getType() != Type::BoolTy) GEN_ERROR("select condition must be boolean!"); - if ((yyvsp[-2].ValueVal)->getType() != (yyvsp[0].ValueVal)->getType()) + if (yyvsp[-2].ValueVal->getType() != yyvsp[0].ValueVal->getType()) GEN_ERROR("select value types should match!"); - (yyval.InstVal) = new SelectInst((yyvsp[-4].ValueVal), (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal)); + yyval.InstVal = new SelectInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal); CHECK_FOR_ERROR - ;} - break; - - case 236: -#line 2556 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + ; + break;} +case 235: +#line 2556 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ NewVarArgs = true; - (yyval.InstVal) = new VAArgInst((yyvsp[-2].ValueVal), *(yyvsp[0].TypeVal)); - delete (yyvsp[0].TypeVal); + yyval.InstVal = new VAArgInst(yyvsp[-2].ValueVal, *yyvsp[0].TypeVal); + delete yyvsp[0].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 237: -#line 2562 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + ; + break;} +case 236: +#line 2562 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ ObsoleteVarArgs = true; - const Type* ArgTy = (yyvsp[-2].ValueVal)->getType(); + const Type* ArgTy = yyvsp[-2].ValueVal->getType(); Function* NF = CurModule.CurrentModule-> getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0); @@ -4994,20 +4226,19 @@ yyreduce: //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)); + 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); + yyval.InstVal = new VAArgInst(foo, *yyvsp[0].TypeVal); + delete yyvsp[0].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 238: -#line 2582 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + ; + break;} +case 237: +#line 2582 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ ObsoleteVarArgs = true; - const Type* ArgTy = (yyvsp[-2].ValueVal)->getType(); + const Type* ArgTy = yyvsp[-2].ValueVal->getType(); Function* NF = CurModule.CurrentModule-> getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0); @@ -5019,78 +4250,73 @@ yyreduce: //b = load foo AllocaInst* foo = new AllocaInst(ArgTy, 0, "vanext.fix"); CurBB->getInstList().push_back(foo); - CallInst* bar = new CallInst(NF, (yyvsp[-2].ValueVal)); + 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)); + Instruction* tmp = new VAArgInst(foo, *yyvsp[0].TypeVal); CurBB->getInstList().push_back(tmp); - (yyval.InstVal) = new LoadInst(foo); - delete (yyvsp[0].TypeVal); + yyval.InstVal = new LoadInst(foo); + delete yyvsp[0].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 239: -#line 2605 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!ExtractElementInst::isValidOperands((yyvsp[-2].ValueVal), (yyvsp[0].ValueVal))) + ; + break;} +case 238: +#line 2605 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!ExtractElementInst::isValidOperands(yyvsp[-2].ValueVal, yyvsp[0].ValueVal)) GEN_ERROR("Invalid extractelement operands!"); - (yyval.InstVal) = new ExtractElementInst((yyvsp[-2].ValueVal), (yyvsp[0].ValueVal)); + yyval.InstVal = new ExtractElementInst(yyvsp[-2].ValueVal, yyvsp[0].ValueVal); CHECK_FOR_ERROR - ;} - break; - - case 240: -#line 2611 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!InsertElementInst::isValidOperands((yyvsp[-4].ValueVal), (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal))) + ; + break;} +case 239: +#line 2611 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!InsertElementInst::isValidOperands(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal)) GEN_ERROR("Invalid insertelement operands!"); - (yyval.InstVal) = new InsertElementInst((yyvsp[-4].ValueVal), (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal)); + yyval.InstVal = new InsertElementInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal); CHECK_FOR_ERROR - ;} - break; - - case 241: -#line 2617 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!ShuffleVectorInst::isValidOperands((yyvsp[-4].ValueVal), (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal))) + ; + break;} +case 240: +#line 2617 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!ShuffleVectorInst::isValidOperands(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal)) GEN_ERROR("Invalid shufflevector operands!"); - (yyval.InstVal) = new ShuffleVectorInst((yyvsp[-4].ValueVal), (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal)); + yyval.InstVal = new ShuffleVectorInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal); CHECK_FOR_ERROR - ;} - break; - - case 242: -#line 2623 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - const Type *Ty = (yyvsp[0].PHIList)->front().first->getType(); + ; + break;} +case 241: +#line 2623 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + const Type *Ty = yyvsp[0].PHIList->front().first->getType(); if (!Ty->isFirstClassType()) GEN_ERROR("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) + 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) GEN_ERROR("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(); + 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... + delete yyvsp[0].PHIList; // Free the list... CHECK_FOR_ERROR - ;} - break; - - case 243: -#line 2638 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { + ; + break;} +case 242: +#line 2638 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ const PointerType *PFTy; const FunctionType *Ty; - if (!(PFTy = dyn_cast<PointerType>((yyvsp[-4].TypeVal)->get())) || + 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(); + 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()); } @@ -5098,31 +4324,31 @@ yyreduce: bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy; if (isVarArg) ParamTypes.pop_back(); - if (!(*(yyvsp[-4].TypeVal))->isFirstClassType() && *(yyvsp[-4].TypeVal) != Type::VoidTy) + if (!(*yyvsp[-4].TypeVal)->isFirstClassType() && *yyvsp[-4].TypeVal != Type::VoidTy) GEN_ERROR("LLVM functions cannot return aggregate types!"); - Ty = FunctionType::get((yyvsp[-4].TypeVal)->get(), ParamTypes, isVarArg); + 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... + Value *V = getVal(PFTy, yyvsp[-3].ValIDVal); // Get the function we're calling... CHECK_FOR_ERROR // Create the call node... - if (!(yyvsp[-1].ValueList)) { // Has no arguments? + if (!yyvsp[-1].ValueList) { // Has no arguments? // Make sure no arguments is a good thing! if (Ty->getNumParams() != 0) GEN_ERROR("No arguments passed to a function that " "expects arguments!"); - (yyval.InstVal) = new CallInst(V, std::vector<Value*>()); + 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(); + 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) @@ -5132,442 +4358,377 @@ yyreduce: if (I != E || (ArgI != ArgE && !Ty->isVarArg())) GEN_ERROR("Invalid number of parameters detected!"); - (yyval.InstVal) = new CallInst(V, *(yyvsp[-1].ValueList)); + 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); - CHECK_FOR_ERROR - ;} - break; - - case 244: -#line 2697 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.InstVal) = (yyvsp[0].InstVal); - CHECK_FOR_ERROR - ;} - break; - - case 245: -#line 2704 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ValueList) = (yyvsp[0].ValueList); - CHECK_FOR_ERROR - ;} - break; - - case 246: -#line 2707 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.ValueList) = new std::vector<Value*>(); - CHECK_FOR_ERROR - ;} - break; - - case 247: -#line 2712 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.BoolVal) = true; - CHECK_FOR_ERROR - ;} - break; - - case 248: -#line 2716 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.BoolVal) = false; - CHECK_FOR_ERROR - ;} - break; - - case 249: -#line 2723 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.InstVal) = new MallocInst(*(yyvsp[-1].TypeVal), 0, (yyvsp[0].UIntVal)); - delete (yyvsp[-1].TypeVal); + cast<CallInst>(yyval.InstVal)->setTailCall(yyvsp[-6].BoolVal); + cast<CallInst>(yyval.InstVal)->setCallingConv(yyvsp[-5].UIntVal); + delete yyvsp[-4].TypeVal; + delete yyvsp[-1].ValueList; + CHECK_FOR_ERROR + ; + break;} +case 243: +#line 2697 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.InstVal = yyvsp[0].InstVal; + CHECK_FOR_ERROR + ; + break;} +case 244: +#line 2704 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ValueList = yyvsp[0].ValueList; + CHECK_FOR_ERROR + ; + break;} +case 245: +#line 2707 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.ValueList = new std::vector<Value*>(); + CHECK_FOR_ERROR + ; + break;} +case 246: +#line 2712 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.BoolVal = true; CHECK_FOR_ERROR - ;} - break; - - case 250: -#line 2728 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - Value* tmpVal = getVal((yyvsp[-2].PrimType), (yyvsp[-1].ValIDVal)); + ; + break;} +case 247: +#line 2716 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.BoolVal = false; CHECK_FOR_ERROR - (yyval.InstVal) = new MallocInst(*(yyvsp[-4].TypeVal), tmpVal, (yyvsp[0].UIntVal)); - delete (yyvsp[-4].TypeVal); - ;} - break; - - case 251: -#line 2734 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - (yyval.InstVal) = new AllocaInst(*(yyvsp[-1].TypeVal), 0, (yyvsp[0].UIntVal)); - delete (yyvsp[-1].TypeVal); + ; + break;} +case 248: +#line 2723 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.InstVal = new MallocInst(*yyvsp[-1].TypeVal, 0, yyvsp[0].UIntVal); + delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR - ;} - break; - - case 252: -#line 2739 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - Value* tmpVal = getVal((yyvsp[-2].PrimType), (yyvsp[-1].ValIDVal)); + ; + break;} +case 249: +#line 2728 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + Value* tmpVal = getVal(yyvsp[-2].PrimType, yyvsp[-1].ValIDVal); + CHECK_FOR_ERROR + yyval.InstVal = new MallocInst(*yyvsp[-4].TypeVal, tmpVal, yyvsp[0].UIntVal); + delete yyvsp[-4].TypeVal; + ; + break;} +case 250: +#line 2734 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + yyval.InstVal = new AllocaInst(*yyvsp[-1].TypeVal, 0, yyvsp[0].UIntVal); + delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR - (yyval.InstVal) = new AllocaInst(*(yyvsp[-4].TypeVal), tmpVal, (yyvsp[0].UIntVal)); - delete (yyvsp[-4].TypeVal); - ;} - break; - - case 253: -#line 2745 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!isa<PointerType>((yyvsp[0].ValueVal)->getType())) + ; + break;} +case 251: +#line 2739 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + Value* tmpVal = getVal(yyvsp[-2].PrimType, yyvsp[-1].ValIDVal); + CHECK_FOR_ERROR + yyval.InstVal = new AllocaInst(*yyvsp[-4].TypeVal, tmpVal, yyvsp[0].UIntVal); + delete yyvsp[-4].TypeVal; + ; + break;} +case 252: +#line 2745 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!isa<PointerType>(yyvsp[0].ValueVal->getType())) GEN_ERROR("Trying to free nonpointer type " + - (yyvsp[0].ValueVal)->getType()->getDescription() + "!"); - (yyval.InstVal) = new FreeInst((yyvsp[0].ValueVal)); + yyvsp[0].ValueVal->getType()->getDescription() + "!"); + yyval.InstVal = new FreeInst(yyvsp[0].ValueVal); CHECK_FOR_ERROR - ;} - break; - - case 254: -#line 2753 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!isa<PointerType>((yyvsp[-1].TypeVal)->get())) + ; + break;} +case 253: +#line 2753 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!isa<PointerType>(yyvsp[-1].TypeVal->get())) GEN_ERROR("Can't load from nonpointer type: " + - (*(yyvsp[-1].TypeVal))->getDescription()); - if (!cast<PointerType>((yyvsp[-1].TypeVal)->get())->getElementType()->isFirstClassType()) + (*yyvsp[-1].TypeVal)->getDescription()); + if (!cast<PointerType>(yyvsp[-1].TypeVal->get())->getElementType()->isFirstClassType()) GEN_ERROR("Can't load from pointer of non-first-class type: " + - (*(yyvsp[-1].TypeVal))->getDescription()); - Value* tmpVal = getVal(*(yyvsp[-1].TypeVal), (yyvsp[0].ValIDVal)); - CHECK_FOR_ERROR - (yyval.InstVal) = new LoadInst(tmpVal, "", (yyvsp[-3].BoolVal)); - delete (yyvsp[-1].TypeVal); - ;} - break; - - case 255: -#line 2765 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - const PointerType *PT = dyn_cast<PointerType>((yyvsp[-1].TypeVal)->get()); + (*yyvsp[-1].TypeVal)->getDescription()); + Value* tmpVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal); + CHECK_FOR_ERROR + yyval.InstVal = new LoadInst(tmpVal, "", yyvsp[-3].BoolVal); + delete yyvsp[-1].TypeVal; + ; + break;} +case 254: +#line 2765 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + const PointerType *PT = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get()); if (!PT) GEN_ERROR("Can't store to a nonpointer type: " + - (*(yyvsp[-1].TypeVal))->getDescription()); + (*yyvsp[-1].TypeVal)->getDescription()); const Type *ElTy = PT->getElementType(); - if (ElTy != (yyvsp[-3].ValueVal)->getType()) - GEN_ERROR("Can't store '" + (yyvsp[-3].ValueVal)->getType()->getDescription() + + if (ElTy != yyvsp[-3].ValueVal->getType()) + GEN_ERROR("Can't store '" + yyvsp[-3].ValueVal->getType()->getDescription() + "' into space of type '" + ElTy->getDescription() + "'!"); - Value* tmpVal = getVal(*(yyvsp[-1].TypeVal), (yyvsp[0].ValIDVal)); + Value* tmpVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal); CHECK_FOR_ERROR - (yyval.InstVal) = new StoreInst((yyvsp[-3].ValueVal), tmpVal, (yyvsp[-5].BoolVal)); - delete (yyvsp[-1].TypeVal); - ;} - break; - - case 256: -#line 2780 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" - { - if (!isa<PointerType>((yyvsp[-2].TypeVal)->get())) + yyval.InstVal = new StoreInst(yyvsp[-3].ValueVal, tmpVal, yyvsp[-5].BoolVal); + delete yyvsp[-1].TypeVal; + ; + break;} +case 255: +#line 2780 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" +{ + if (!isa<PointerType>(yyvsp[-2].TypeVal->get())) GEN_ERROR("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) + 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 (ConstantInt *CUI = dyn_cast<ConstantInt>((*(yyvsp[0].ValueList))[i])) + if (ConstantInt *CUI = dyn_cast<ConstantInt>((*yyvsp[0].ValueList)[i])) if (CUI->getType() == Type::UByteTy) - (*(yyvsp[0].ValueList))[i] = ConstantExpr::getCast(CUI, Type::UIntTy); + (*yyvsp[0].ValueList)[i] = ConstantExpr::getCast(CUI, Type::UIntTy); - if (!GetElementPtrInst::getIndexedType(*(yyvsp[-2].TypeVal), *(yyvsp[0].ValueList), true)) + if (!GetElementPtrInst::getIndexedType(*yyvsp[-2].TypeVal, *yyvsp[0].ValueList, true)) GEN_ERROR("Invalid getelementptr indices for type '" + - (*(yyvsp[-2].TypeVal))->getDescription()+ "'!"); - Value* tmpVal = getVal(*(yyvsp[-2].TypeVal), (yyvsp[-1].ValIDVal)); - CHECK_FOR_ERROR - (yyval.InstVal) = new GetElementPtrInst(tmpVal, *(yyvsp[0].ValueList)); - delete (yyvsp[-2].TypeVal); - delete (yyvsp[0].ValueList); - ;} - break; - - - default: break; - } - -/* Line 1126 of yacc.c. */ -#line 5303 "llvmAsmParser.tab.c" + (*yyvsp[-2].TypeVal)->getDescription()+ "'!"); + Value* tmpVal = getVal(*yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal); + CHECK_FOR_ERROR + yyval.InstVal = new GetElementPtrInst(tmpVal, *yyvsp[0].ValueList); + delete yyvsp[-2].TypeVal; + delete yyvsp[0].ValueList; + ; + break;} +} + /* the action file gets copied in in place of this dollarsign */ +#line 543 "/usr/share/bison.simple" yyvsp -= yylen; yyssp -= yylen; +#ifdef YYLSP_NEEDED + yylsp -= yylen; +#endif - - YY_STACK_PRINT (yyss, yyssp); +#if YYDEBUG != 0 + if (yydebug) + { + short *ssp1 = yyss - 1; + fprintf (stderr, "state stack now"); + while (ssp1 != yyssp) + fprintf (stderr, " %d", *++ssp1); + fprintf (stderr, "\n"); + } +#endif *++yyvsp = yyval; +#ifdef YYLSP_NEEDED + yylsp++; + if (yylen == 0) + { + yylsp->first_line = yylloc.first_line; + yylsp->first_column = yylloc.first_column; + yylsp->last_line = (yylsp-1)->last_line; + yylsp->last_column = (yylsp-1)->last_column; + yylsp->text = 0; + } + else + { + yylsp->last_line = (yylsp+yylen-1)->last_line; + yylsp->last_column = (yylsp+yylen-1)->last_column; + } +#endif - /* 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. */ + /* 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 = yypgoto[yyn - YYNTBASE] + *yyssp; + if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else - yystate = yydefgoto[yyn - YYNTOKENS]; + yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; +yyerrlab: /* here on detecting error */ -/*------------------------------------. -| yyerrlab -- here on detecting error | -`------------------------------------*/ -yyerrlab: - /* If not already recovering from an error, report this error. */ - if (!yyerrstatus) + if (! yyerrstatus) + /* If not already recovering from an error, report this error. */ { ++yynerrs; -#if YYERROR_VERBOSE + +#ifdef YYERROR_VERBOSE yyn = yypact[yystate]; - if (YYPACT_NINF < yyn && yyn < YYLAST) + if (yyn > YYFLAG && yyn < YYLAST) { - int yytype = YYTRANSLATE (yychar); - YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]); - YYSIZE_T yysize = yysize0; - YYSIZE_T yysize1; - int yysize_overflow = 0; - char *yymsg = 0; -# define YYERROR_VERBOSE_ARGS_MAXIMUM 5 - char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; - int yyx; - -#if 0 - /* This is so xgettext sees the translatable formats that are - constructed on the fly. */ - YY_("syntax error, unexpected %s"); - YY_("syntax error, unexpected %s, expecting %s"); - YY_("syntax error, unexpected %s, expecting %s or %s"); - YY_("syntax error, unexpected %s, expecting %s or %s or %s"); - YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"); -#endif - char *yyfmt; - char const *yyf; - static char const yyunexpected[] = "syntax error, unexpected %s"; - static char const yyexpecting[] = ", expecting %s"; - static char const yyor[] = " or %s"; - char yyformat[sizeof yyunexpected - + sizeof yyexpecting - 1 - + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2) - * (sizeof yyor - 1))]; - char const *yyprefix = yyexpecting; - - /* 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 = 1; - - yyarg[0] = yytname[yytype]; - yyfmt = yystpcpy (yyformat, yyunexpected); - - for (yyx = yyxbegin; yyx < yyxend; ++yyx) - if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) - { - if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) - { - yycount = 1; - yysize = yysize0; - yyformat[sizeof yyunexpected - 1] = '\0'; - break; - } - yyarg[yycount++] = yytname[yyx]; - yysize1 = yysize + yytnamerr (0, yytname[yyx]); - yysize_overflow |= yysize1 < yysize; - yysize = yysize1; - yyfmt = yystpcpy (yyfmt, yyprefix); - yyprefix = yyor; - } - - yyf = YY_(yyformat); - yysize1 = yysize + yystrlen (yyf); - yysize_overflow |= yysize1 < yysize; - yysize = yysize1; - - if (!yysize_overflow && yysize <= YYSTACK_ALLOC_MAXIMUM) - yymsg = (char *) YYSTACK_ALLOC (yysize); - if (yymsg) + int size = 0; + char *msg; + int x, count; + + count = 0; + /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ + for (x = (yyn < 0 ? -yyn : 0); + x < (sizeof(yytname) / sizeof(char *)); x++) + if (yycheck[x + yyn] == x) + size += strlen(yytname[x]) + 15, count++; + msg = (char *) malloc(size + 15); + if (msg != 0) { - /* Avoid sprintf, as that infringes on the user's name space. - Don't have undefined behavior even if the translation - produced a string with the wrong number of "%s"s. */ - char *yyp = yymsg; - int yyi = 0; - while ((*yyp = *yyf)) + strcpy(msg, "parse error"); + + if (count < 5) { - if (*yyp == '%' && yyf[1] == 's' && yyi < yycount) - { - yyp += yytnamerr (yyp, yyarg[yyi++]); - yyf += 2; - } - else - { - yyp++; - yyf++; - } + count = 0; + for (x = (yyn < 0 ? -yyn : 0); + x < (sizeof(yytname) / sizeof(char *)); x++) + if (yycheck[x + yyn] == x) + { + strcat(msg, count == 0 ? ", expecting `" : " or `"); + strcat(msg, yytname[x]); + strcat(msg, "'"); + count++; + } } - yyerror (yymsg); - YYSTACK_FREE (yymsg); + yyerror(msg); + free(msg); } else - { - yyerror (YY_("syntax error")); - goto yyexhaustedlab; - } + yyerror ("parse error; also virtual memory exceeded"); } else #endif /* YYERROR_VERBOSE */ - yyerror (YY_("syntax error")); + yyerror("parse error"); } - + goto yyerrlab1; +yyerrlab1: /* here on error raised explicitly by an action */ if (yyerrstatus == 3) { - /* If just tried and failed to reuse look-ahead token after an - error, discard it. */ - - if (yychar <= YYEOF) - { - /* Return failure if at end of input. */ - if (yychar == YYEOF) - YYABORT; - } - else - { - yydestruct ("Error: discarding", yytoken, &yylval); - yychar = YYEMPTY; - } + /* if just tried and failed to reuse lookahead token after an error, discard it. */ + + /* return failure if at end of input */ + if (yychar == YYEOF) + YYABORT; + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); +#endif + + yychar = YYEMPTY; } - /* Else will try to reuse look-ahead token after shifting the error - token. */ - goto yyerrlab1; + /* Else will try to reuse lookahead token + after shifting the error token. */ + yyerrstatus = 3; /* Each real token shifted decrements this */ -/*---------------------------------------------------. -| yyerrorlab -- error raised explicitly by YYERROR. | -`---------------------------------------------------*/ -yyerrorlab: + goto yyerrhandle; - /* Pacify compilers like GCC when the user code never invokes - YYERROR and the label yyerrorlab therefore never appears in user - code. */ - if (0) - goto yyerrorlab; +yyerrdefault: /* current state does not do anything special for the error token. */ -yyvsp -= yylen; - yyssp -= yylen; - yystate = *yyssp; - goto yyerrlab1; +#if 0 + /* This is wrong; only states that explicitly want error tokens + should shift them. */ + yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ + if (yyn) goto yydefault; +#endif +yyerrpop: /* pop the current state because it cannot handle the error token */ -/*-------------------------------------------------------------. -| yyerrlab1 -- common code for both syntax error and YYERROR. | -`-------------------------------------------------------------*/ -yyerrlab1: - yyerrstatus = 3; /* Each real token shifted decrements this. */ + if (yyssp == yyss) YYABORT; + yyvsp--; + yystate = *--yyssp; +#ifdef YYLSP_NEEDED + yylsp--; +#endif - for (;;) +#if YYDEBUG != 0 + if (yydebug) { - yyn = yypact[yystate]; - if (yyn != YYPACT_NINF) - { - yyn += YYTERROR; - if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) - { - yyn = yytable[yyn]; - if (0 < yyn) - break; - } - } + short *ssp1 = yyss - 1; + fprintf (stderr, "Error: state stack now"); + while (ssp1 != yyssp) + fprintf (stderr, " %d", *++ssp1); + fprintf (stderr, "\n"); + } +#endif - /* Pop the current state because it cannot handle the error token. */ - if (yyssp == yyss) - YYABORT; +yyerrhandle: + + yyn = yypact[yystate]; + if (yyn == YYFLAG) + goto yyerrdefault; + yyn += YYTERROR; + if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) + goto yyerrdefault; - yydestruct ("Error: popping", yystos[yystate], yyvsp); - YYPOPSTACK; - yystate = *yyssp; - YY_STACK_PRINT (yyss, yyssp); + yyn = yytable[yyn]; + if (yyn < 0) + { + if (yyn == YYFLAG) + goto yyerrpop; + yyn = -yyn; + goto yyreduce; } + else if (yyn == 0) + goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; - *++yyvsp = yylval; - +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Shifting error token, "); +#endif - /* Shift the error token. */ - YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); + *++yyvsp = yylval; +#ifdef YYLSP_NEEDED + *++yylsp = yylloc; +#endif yystate = yyn; goto yynewstate; - -/*-------------------------------------. -| yyacceptlab -- YYACCEPT comes here. | -`-------------------------------------*/ -yyacceptlab: - yyresult = 0; - goto yyreturn; - -/*-----------------------------------. -| yyabortlab -- YYABORT comes here. | -`-----------------------------------*/ -yyabortlab: - yyresult = 1; - goto yyreturn; - -#ifndef yyoverflow -/*-------------------------------------------------. -| yyexhaustedlab -- memory exhaustion comes here. | -`-------------------------------------------------*/ -yyexhaustedlab: - yyerror (YY_("memory exhausted")); - yyresult = 2; - /* Fall through. */ + yyacceptlab: + /* YYACCEPT comes here. */ + if (yyfree_stacks) + { + free (yyss); + free (yyvs); +#ifdef YYLSP_NEEDED + free (yyls); #endif + } + return 0; -yyreturn: - if (yychar != YYEOF && yychar != YYEMPTY) - yydestruct ("Cleanup: discarding lookahead", - yytoken, &yylval); - while (yyssp != yyss) + yyabortlab: + /* YYABORT comes here. */ + if (yyfree_stacks) { - yydestruct ("Cleanup: popping", - yystos[*yyssp], yyvsp); - YYPOPSTACK; - } -#ifndef yyoverflow - if (yyss != yyssa) - YYSTACK_FREE (yyss); + free (yyss); + free (yyvs); +#ifdef YYLSP_NEEDED + free (yyls); #endif - return yyresult; + } + return 1; } - - -#line 2806 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" +#line 2806 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y" void llvm::GenerateError(const std::string &message, int LineNo) { @@ -5590,4 +4751,3 @@ int yyerror(const char *ErrorMsg) { GenerateError(errMsg); return 0; } - diff --git a/llvm/lib/AsmParser/llvmAsmParser.y b/llvm/lib/AsmParser/llvmAsmParser.y index 33f46fc..8eea9ab 100644 --- a/llvm/lib/AsmParser/llvmAsmParser.y +++ b/llvm/lib/AsmParser/llvmAsmParser.y @@ -1,164 +1,233 @@ -//===-- llvmAsmParser.y - Parser for llvm assembly files ---------*- C++ -*--=// +//===-- llvmAsmParser.y - Parser for llvm assembly files --------*- C++ -*-===// // -// This file implements the bison parser for LLVM assembly languages files. +// 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. +// +//===----------------------------------------------------------------------===// // -// TODO: Parse comments and add them to an internal node... so that they may -// be saved in the bytecode format as well as everything else. Very important -// for a general IR format. +// This file implements the bison parser for LLVM assembly languages files. // +//===----------------------------------------------------------------------===// %{ #include "ParserInternals.h" -#include "llvm/Assembly/Parser.h" -#include "llvm/SymbolTable.h" +#include "llvm/CallingConv.h" +#include "llvm/InlineAsm.h" +#include "llvm/Instructions.h" #include "llvm/Module.h" -#include "llvm/GlobalVariable.h" -#include "llvm/Method.h" -#include "llvm/BasicBlock.h" -#include "llvm/DerivedTypes.h" -#include "llvm/iTerminators.h" -#include "llvm/iMemory.h" -#include "llvm/Support/STLExtras.h" -#include "llvm/Support/DepthFirstIterator.h" -#include <list> -#include <utility> // Get definition of pair class +#include "llvm/SymbolTable.h" +#include "llvm/Assembly/AutoUpgrade.h" +#include "llvm/Support/GetElementPtrTypeIterator.h" +#include "llvm/ADT/STLExtras.h" +#include "llvm/Support/MathExtras.h" #include <algorithm> -#include <stdio.h> // This embarasment is due to our flex lexer... - -int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit +#include <iostream> +#include <list> +#include <utility> + +// The following is a gross hack. In order to rid the libAsmParser library of +// exceptions, we have to have a way of getting the yyparse function to go into +// an error situation. So, whenever we want an error to occur, the GenerateError +// function (see bottom of file) sets TriggerError. Then, at the end of each +// production in the grammer we use CHECK_FOR_ERROR which will invoke YYERROR +// (a goto) to put YACC in error state. Furthermore, several calls to +// GenerateError are made from inside productions and they must simulate the +// previous exception behavior by exiting the production immediately. We have +// replaced these with the GEN_ERROR macro which calls GeneratError and then +// immediately invokes YYERROR. This would be so much cleaner if it was a +// recursive descent parser. +static bool TriggerError = false; +#define CHECK_FOR_ERROR { if (TriggerError) { TriggerError = false; YYABORT; } } +#define GEN_ERROR(msg) { GenerateError(msg); YYERROR; } + +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; -string CurFilename; // 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) cerr << X +#define UR_OUT(X) std::cerr << X #else #define UR_OUT(X) #endif -// This contains info used when building the body of a method. It is destroyed -// when the method is completed. +#define YYERROR_VERBOSE 1 + +static bool ObsoleteVarArgs; +static bool NewVarArgs; +static BasicBlock *CurBB; +static GlobalVariable *CurGV; + + +// This contains info used when building the body of a function. It is +// destroyed when the function is completed. // -typedef vector<Value *> ValueList; // Numbered defs -static void ResolveDefinitions(vector<ValueList> &LateResolvers); -static void ResolveTypes (vector<PATypeHolder<Type> > &LateResolveTypes); +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; - vector<ValueList> Values; // Module level numbered definitions - vector<ValueList> LateResolveValues; - vector<PATypeHolder<Type> > Types, LateResolveTypes; + 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 on 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 methods at method compilation time (calls to - // methods before they are defined), resolve them now... Types are resolved - // when the constant pool has been completely parsed. + // 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); + if (TriggerError) + return; + + // 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"; + } + GenerateError(UndefinedReferences); + return; + } + + // Look for intrinsic functions and CallInst that need to be upgraded + for (Module::iterator FI = CurrentModule->begin(), + FE = CurrentModule->end(); FI != FE; ) + UpgradeCallsToIntrinsic(FI++); - Values.clear(); // Clear out method local definitions + 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 PerMethodInfo { - Method *CurrentMethod; // Pointer to current method being created +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? + GlobalValue::LinkageTypes Linkage; // Linkage for forward declaration. - vector<ValueList> Values; // Keep track of numbered definitions - vector<ValueList> LateResolveValues; - vector<PATypeHolder<Type> > Types, LateResolveTypes; - bool isDeclare; // Is this method 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 PerMethodInfo() { - CurrentMethod = 0; + inline PerFunctionInfo() { + CurrentFunction = 0; isDeclare = false; + Linkage = GlobalValue::ExternalLinkage; } - inline ~PerMethodInfo() {} - - inline void MethodStart(Method *M) { - CurrentMethod = M; + inline void FunctionStart(Function *M) { + CurrentFunction = M; + NextBBNum = 0; } - void MethodDone() { - // If we could not resolve some blocks at parsing time (forward branches) - // resolve the branches now... - ResolveDefinitions(LateResolveValues); + void FunctionDone() { + NumberedBlocks.clear(); - Values.clear(); // Clear out method local definitions - Types.clear(); - CurrentMethod = 0; + // Any forward referenced blocks left? + if (!BBForwardRefs.empty()) { + GenerateError("Undefined reference to label " + + BBForwardRefs.begin()->first->getName()); + return; + } + + // Resolve all forward references now. + ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues); + + Values.clear(); // Clear out function local definitions + CurrentFunction = 0; isDeclare = false; + Linkage = GlobalValue::ExternalLinkage; } -} CurMeth; // Info for the current method... +} CurFun; // Info for the current function... + +static bool inFunctionScope() { return CurFun.CurrentFunction != 0; } //===----------------------------------------------------------------------===// // Code to handle definitions of all the types //===----------------------------------------------------------------------===// -static void InsertValue(Value *D, vector<ValueList> &ValueTab = CurMeth.Values){ - if (!D->hasName()) { // Is this a numbered definition? - unsigned type = D->getType()->getUniqueID(); - if (ValueTab.size() <= type) - ValueTab.resize(type+1, ValueList()); - //printf("Values[%d][%d] = %d\n", type, ValueTab[type].size(), D); - ValueTab[type].push_back(D); - } -} +static int InsertValue(Value *V, + std::map<const Type*,ValueList> &ValueTab = CurFun.Values) { + if (V->hasName()) return -1; // Is this a numbered definition? -// TODO: FIXME when Type are not const -static void InsertType(const Type *Ty, vector<PATypeHolder<Type> > &Types) { - Types.push_back(Ty); + // 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 0: { // Is it a numbered definition? - unsigned Num = (unsigned)D.Num; - + case ValID::NumberVal: // Is it a numbered definition? // Module constants occupy the lowest numbered slots... - if (Num < CurModule.Types.size()) - return CurModule.Types[Num]; - - Num -= CurModule.Types.size(); - - // Check that the number is within bounds... - if (Num <= CurMeth.Types.size()) - return CurMeth.Types[Num]; - } - case 1: { // Is it a named definition? - string Name(D.Name); - SymbolTable *SymTab = 0; - if (CurMeth.CurrentMethod) - SymTab = CurMeth.CurrentMethod->getSymbolTable(); - Value *N = SymTab ? SymTab->lookup(Type::TypeTy, Name) : 0; - - if (N == 0) { - // Symbol table doesn't automatically chain yet... because the method - // hasn't been added to the module... - // - SymTab = CurModule.CurrentModule->getSymbolTable(); - if (SymTab) - N = SymTab->lookup(Type::TypeTy, Name); - if (N == 0) break; + 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; } - - D.destroy(); // Free old strdup'd memory... - return N->castTypeAsserting(); - } + break; default: - ThrowException("Invalid symbol type reference!"); + GenerateError("Internal parser error: Invalid symbol type reference!"); + return 0; } // If we reached here, we referenced either a symbol that we don't know about @@ -167,132 +236,251 @@ static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) { // if (DoNotImprovise) return 0; // Do we just want a null to be returned? - vector<PATypeHolder<Type> > *LateResolver = CurMeth.CurrentMethod ? - &CurMeth.LateResolveTypes : &CurModule.LateResolveTypes; - Type *Typ = new TypePlaceHolder(Type::TypeTy, D); - InsertType(Typ, *LateResolver); + if (inFunctionScope()) { + if (D.Type == ValID::NameVal) { + GenerateError("Reference to an undefined type: '" + D.getName() + "'"); + return 0; + } else { + GenerateError("Reference to an undefined type: #" + itostr(D.Num)); + return 0; + } + } + + 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); } -static Value *getVal(const Type *Ty, const ValID &D, - bool DoNotImprovise = false) { - assert(Ty != Type::TypeTy && "Should use getTypeVal for types!"); +// 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)) { + GenerateError("Functions are not values and " + "must be referenced as pointers"); + return 0; + } switch (D.Type) { - case 0: { // Is it a numbered definition? - unsigned type = Ty->getUniqueID(); + case ValID::NumberVal: { // Is it a numbered definition? unsigned Num = (unsigned)D.Num; // Module constants occupy the lowest numbered slots... - if (type < CurModule.Values.size()) { - if (Num < CurModule.Values[type].size()) - return CurModule.Values[type][Num]; - - Num -= CurModule.Values[type].size(); + 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 - if (CurMeth.Values.size() <= type) - break; + VI = CurFun.Values.find(Ty); + if (VI == CurFun.Values.end()) return 0; // Check that the number is within bounds... - if (CurMeth.Values[type].size() <= Num) - break; - - return CurMeth.Values[type][Num]; - } - case 1: { // Is it a named definition? - string Name(D.Name); - SymbolTable *SymTab = 0; - if (CurMeth.CurrentMethod) - SymTab = CurMeth.CurrentMethod->getSymbolTable(); - Value *N = SymTab ? SymTab->lookup(Ty, Name) : 0; - - if (N == 0) { - // Symbol table doesn't automatically chain yet... because the method - // hasn't been added to the module... - // - SymTab = CurModule.CurrentModule->getSymbolTable(); - if (SymTab) - N = SymTab->lookup(Ty, Name); - if (N == 0) break; - } + 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; } - case 2: // Is it a constant pool reference?? - case 3: // Is it an unsigned const pool reference? - case 4: // Is it a string const pool reference? - case 5:{ // Is it a floating point const pool reference? - ConstPoolVal *CPV = 0; - - // Check to make sure that "Ty" is an integral type, and that our - // value will fit into the specified type... - switch (D.Type) { - case 2: - if (Ty == Type::BoolTy) { // Special handling for boolean data - CPV = ConstPoolBool::get(D.ConstPool64 != 0); - } else { - if (!ConstPoolSInt::isValueValidForType(Ty, D.ConstPool64)) - ThrowException("Symbolic constant pool value '" + - itostr(D.ConstPool64) + "' is invalid for type '" + - Ty->getName() + "'!"); - CPV = ConstPoolSInt::get(Ty, D.ConstPool64); - } - break; - case 3: - if (!ConstPoolUInt::isValueValidForType(Ty, D.UConstPool64)) { - if (!ConstPoolSInt::isValueValidForType(Ty, D.ConstPool64)) { - ThrowException("Integral constant pool reference is invalid!"); - } else { // This is really a signed reference. Transmogrify. - CPV = ConstPoolSInt::get(Ty, D.ConstPool64); - } - } else { - CPV = ConstPoolUInt::get(Ty, D.UConstPool64); + // 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 (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) { + GenerateError("Signed integral constant '" + + itostr(D.ConstPool64) + "' is invalid for type '" + + Ty->getDescription() + "'!"); + return 0; + } + return ConstantInt::get(Ty, D.ConstPool64); + + case ValID::ConstUIntVal: // Is it an unsigned const pool reference? + if (!ConstantInt::isValueValidForType(Ty, D.UConstPool64)) { + if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) { + GenerateError("Integral constant '" + utostr(D.UConstPool64) + + "' is invalid or out of range!"); + return 0; + } else { // This is really a signed reference. Transmogrify. + return ConstantInt::get(Ty, D.ConstPool64); } - break; - case 4: - cerr << "FIXME: TODO: String constants [sbyte] not implemented yet!\n"; - abort(); - break; - case 5: - if (!ConstPoolFP::isValueValidForType(Ty, D.ConstPoolFP)) - ThrowException("FP constant invalid for type!!"); - else - CPV = ConstPoolFP::get(Ty, D.ConstPoolFP); - break; + } else { + return ConstantInt::get(Ty, D.UConstPool64); + } + + case ValID::ConstFPVal: // Is it a floating point const pool reference? + if (!ConstantFP::isValueValidForType(Ty, D.ConstPoolFP)) { + GenerateError("FP constant invalid for type!!"); + return 0; + } + return ConstantFP::get(Ty, D.ConstPoolFP); + + case ValID::ConstNullVal: // Is it a null value? + if (!isa<PointerType>(Ty)) { + GenerateError("Cannot create a a non pointer null!"); + return 0; + } + return ConstantPointerNull::get(cast<PointerType>(Ty)); + + case ValID::ConstUndefVal: // Is it an undef value? + return UndefValue::get(Ty); + + case ValID::ConstZeroVal: // Is it a zero value? + return Constant::getNullValue(Ty); + + case ValID::ConstantVal: // Fully resolved constant? + if (D.ConstantValue->getType() != Ty) { + GenerateError("Constant expression type different from required type!"); + return 0; + } + return D.ConstantValue; + + case ValID::InlineAsmVal: { // Inline asm expression + const PointerType *PTy = dyn_cast<PointerType>(Ty); + const FunctionType *FTy = + PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0; + if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints)) { + GenerateError("Invalid type for asm constraint string!"); + return 0; } - assert(CPV && "How did we escape creating a constant??"); - return CPV; - } // End of case 2,3,4 + InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints, + D.IAD->HasSideEffects); + D.destroy(); // Free InlineAsmDescriptor. + return IA; + } 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) { + GenerateError("Cannot use a basic block here"); + return 0; + } + + // See if the value has already been defined. + Value *V = getValNonImprovising(Ty, ID); + if (V) return V; + if (TriggerError) return 0; + + if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty)) { + GenerateError("Invalid use of a composite type!"); + return 0; + } // 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? + 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; +} - Value *d = 0; - vector<ValueList> *LateResolver = (CurMeth.CurrentMethod) ? - &CurMeth.LateResolveValues : &CurModule.LateResolveValues; +/// 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: + GenerateError("Illegal label reference " + ID.getName()); + return 0; + 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. + GenerateError("Redefinition of label " + ID.getName()); + return 0; + } + + ID.destroy(); // Free strdup'd memory. + return BB; + } - switch (Ty->getPrimitiveID()) { - case Type::LabelTyID: d = new BBPlaceHolder(Ty, D); break; - case Type::MethodTyID: d = new MethPlaceHolder(Ty, D); - LateResolver = &CurModule.LateResolveValues; break; - default: d = new ValuePlaceHolder(Ty, D); break; + // 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; } - assert(d != 0 && "How did we not make something?"); - InsertValue(d, *LateResolver); - return d; + // 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; } @@ -304,219 +492,550 @@ static Value *getVal(const Type *Ty, const ValID &D, // values not defined yet... for example, a forward branch, or the PHI node for // a loop body. // -// This keeps a table (CurMeth.LateResolveValues) of all such forward references +// 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 +// 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(vector<ValueList> &LateResolvers) { +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 (unsigned ty = 0; ty < LateResolvers.size(); ty++) { - while (!LateResolvers[ty].empty()) { - Value *V = LateResolvers[ty].back(); - LateResolvers[ty].pop_back(); - ValID &DID = getValIDFromPlaceHolder(V); - - Value *TheRealValue = getVal(Type::getUniqueIDType(ty), DID, true); - - if (TheRealValue == 0) { - if (DID.Type == 1) - ThrowException("Reference to an invalid definition: '" +DID.getName()+ - "' of type '" + V->getType()->getDescription() + "'", - getLineNumFromPlaceHolder(V)); - else - ThrowException("Reference to an invalid definition: #" + - itostr(DID.Num) + " of type '" + - V->getType()->getDescription() + "'", - getLineNumFromPlaceHolder(V)); + 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 (TriggerError) + return; + 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) { + GenerateError("Reference to an invalid definition: '" +DID.getName()+ + "' of type '" + V->getType()->getDescription() + "'", + PHI->second.second); + return; + } else { + GenerateError("Reference to an invalid definition: #" + + itostr(DID.Num) + " of type '" + + V->getType()->getDescription() + "'", + PHI->second.second); + return; + } } - - assert(!V->isType() && "Types should be in LateResolveTypes!"); - - V->replaceAllUsesWith(TheRealValue); - delete V; } } 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()); -// ResolveTypes - This goes through the forward referenced type table and makes -// sure that all type references are complete. This code is executed after the -// constant pool of a method or module is completely parsed. + 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 ResolveTypes(vector<PATypeHolder<Type> > &LateResolveTypes) { - while (!LateResolveTypes.empty()) { - const Type *Ty = LateResolveTypes.back(); - ValID &DID = getValIDFromPlaceHolder(Ty); - - const Type *TheRealType = getTypeVal(DID, true); - if (TheRealType == 0) { - if (DID.Type == 1) - ThrowException("Reference to an invalid type: '" +DID.getName(), - getLineNumFromPlaceHolder(Ty)); - else - ThrowException("Reference to an invalid type: #" + itostr(DID.Num), - getLineNumFromPlaceHolder(Ty)); +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) { + GenerateError("Can't assign name '" + Name+"' to value with void type!"); + return; } - // FIXME: When types are not const - DerivedType *DTy = const_cast<DerivedType*>(Ty->castDerivedTypeAsserting()); - - // Refine the opaque type we had to the new type we are getting. - DTy->refineAbstractTypeTo(TheRealType); + assert(inFunctionScope() && "Must be in function scope!"); + SymbolTable &ST = CurFun.CurrentFunction->getSymbolTable(); + if (ST.lookup(V->getType(), Name)) { + GenerateError("Redefinition of value named '" + Name + "' in the '" + + V->getType()->getDescription() + "' type plane!"); + return; + } - // No need to delete type, refine does that for us. - LateResolveTypes.pop_back(); + // Set the name. + V->setName(Name); } } -// setValueName - Set the specified value to the name given. The name may be +/// ParseGlobalVariable - Handle parsing of a global. If Initializer is null, +/// this is a declaration, otherwise it is a definition. +static GlobalVariable * +ParseGlobalVariable(char *NameStr,GlobalValue::LinkageTypes Linkage, + bool isConstantGlobal, const Type *Ty, + Constant *Initializer) { + if (isa<FunctionType>(Ty)) { + GenerateError("Cannot declare global vars of function type!"); + return 0; + } + + 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 GV; + } + + // 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 EGV; + } + + GenerateError("Redefinition of global variable named '" + Name + + "' in the '" + Ty->getDescription() + "' type plane!"); + return 0; + } + } + + // 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); + return GV; +} + +// 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. // -static void setValueName(Value *V, char *NameStr) { - if (NameStr == 0) return; - string Name(NameStr); // Copy string +// 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 - SymbolTable *ST = CurMeth.CurrentMethod ? - CurMeth.CurrentMethod->getSymbolTableSure() : - CurModule.CurrentModule->getSymbolTableSure(); + // We don't allow assigning names to void type + if (T == Type::VoidTy) { + GenerateError("Can't assign name '" + Name + "' to the void type!"); + return false; + } + + // 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?"); - Value *Existing = ST->lookup(V->getType(), Name); - if (Existing) { // Inserting a name that is already defined??? // 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 Type *Ty = Existing->castType()) - if (Ty->isOpaqueType()) { - // We ARE replacing 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; + } - // TODO: FIXME when types are not const! - const_cast<DerivedType*>(Ty->castDerivedTypeAsserting())->refineAbstractTypeTo(V->castTypeAsserting()); - return; - } + // 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. - // Otherwise, we are a simple redefinition of a value, baaad - ThrowException("Redefinition of value name '" + Name + "' in the '" + - V->getType()->getDescription() + "' type plane!"); + // Any other kind of (non-equivalent) redefinition is an error. + GenerateError("Redefinition of type named '" + Name + "' in the '" + + T->getDescription() + "' type plane!"); } - V->setName(Name, ST); + return false; } - //===----------------------------------------------------------------------===// // Code for handling upreferences in type names... // -// TypeContains - Returns true if Ty contains E in it. +// TypeContains - Returns true if Ty directly contains E in it. // static bool TypeContains(const Type *Ty, const Type *E) { - return find(df_begin(Ty), df_end(Ty), E) != df_end(Ty); + 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) {} + }; +} -static vector<pair<unsigned, OpaqueType *> > UpRefs; - -static PATypeHolder<Type> HandleUpRefs(const Type *ty) { - PATypeHolder<Type> Ty(ty); - UR_OUT(UpRefs.size() << " upreferences active!\n"); - for (unsigned i = 0; i < UpRefs.size(); ) { - UR_OUT("TypeContains(" << Ty->getDescription() << ", " - << UpRefs[i].second->getDescription() << ") = " - << TypeContains(Ty, UpRefs[i].second) << endl); - if (TypeContains(Ty, UpRefs[i].second)) { - unsigned Level = --UpRefs[i].first; // Decrement level of upreference - UR_OUT("Uplevel Ref Level = " << Level << endl); - if (Level == 0) { // Upreference should be resolved! - UR_OUT("About to resolve upreference!\n"; - string OldName = UpRefs[i].second->getDescription()); - UpRefs[i].second->refineAbstractTypeTo(Ty); - UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list... - UR_OUT("Type '" << OldName << "' refined upreference to: " - << (const void*)Ty << ", " << Ty->getDescription() << endl); - continue; +// 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 isn't abstract, or if there are no up-references in it, then there is + // nothing to resolve here. + if (!ty->isAbstract() || UpRefs.empty()) 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... } } + } - ++i; // Otherwise, no resolve, move on... + if (TypeToResolve) { + UR_OUT(" * Resolving upreference for " + << UpRefs[i].second->getDescription() << "\n"; + std::string OldName = TypeToResolve->getDescription()); + TypeToResolve->refineAbstractTypeTo(Ty); } - // FIXME: TODO: this should return the updated type + return Ty; } -template <class TypeTy> -inline static void TypeDone(PATypeHolder<TypeTy> *Ty) { - if (UpRefs.size()) - ThrowException("Invalid upreference in type: " + (*Ty)->getDescription()); +/// This function is used to obtain the correct opcode for an instruction when +/// an obsolete opcode is encountered. The OI parameter (OpcodeInfo) has both +/// an opcode and an "obsolete" flag. These are generated by the lexer and +/// the "obsolete" member will be true when the lexer encounters the token for +/// an obsolete opcode. For example, "div" was replaced by [usf]div but we need +/// to maintain backwards compatibility for asm files that still have the "div" +/// instruction. This function handles converting div -> [usf]div appropriately. +/// @brief Convert obsolete opcodes to new values +static void +sanitizeOpCode(OpcodeInfo<Instruction::BinaryOps> &OI, const PATypeHolder& PATy) +{ + // If its not obsolete, don't do anything + if (!OI.obsolete) + return; + + // If its a packed type we want to use the element type + const Type* Ty = PATy; + if (const PackedType* PTy = dyn_cast<PackedType>(Ty)) + Ty = PTy->getElementType(); + + // Depending on the opcode .. + switch (OI.opcode) { + default: + GenerateError("Invalid obsolete opCode (check Lexer.l)"); + break; + case Instruction::UDiv: + // Handle cases where the opcode needs to change + if (Ty->isFloatingPoint()) + OI.opcode = Instruction::FDiv; + else if (Ty->isSigned()) + OI.opcode = Instruction::SDiv; + break; + case Instruction::URem: + if (Ty->isFloatingPoint()) + OI.opcode = Instruction::FRem; + else if (Ty->isSigned()) + OI.opcode = Instruction::SRem; + break; + } + // Its not obsolete any more, we fixed it. + OI.obsolete = false; } + +// common code from the two 'RunVMAsmParser' functions +static Module* RunParser(Module * M) { -// newTH - Allocate a new type holder for the specified type -template <class TypeTy> -inline static PATypeHolder<TypeTy> *newTH(const TypeTy *Ty) { - return new PATypeHolder<TypeTy>(Ty); -} -template <class TypeTy> -inline static PATypeHolder<TypeTy> *newTH(const PATypeHolder<TypeTy> &TH) { - return new PATypeHolder<TypeTy>(TH); -} + llvmAsmlineno = 1; // Reset the current line number... + ObsoleteVarArgs = false; + NewVarArgs = false; + CurModule.CurrentModule = M; + + // Check to make sure the parser succeeded + if (yyparse()) { + if (ParserResult) + delete ParserResult; + return 0; + } + // Check to make sure that parsing produced a result + if (!ParserResult) + return 0; -// newTHC - Allocate a new type holder for the specified type that can be -// casted to a new Type type. -template <class TypeTy, class OldTy> -inline static PATypeHolder<TypeTy> *newTHC(const PATypeHolder<OldTy> &Old) { - return new PATypeHolder<TypeTy>((const TypeTy*)Old.get()); -} + // Reset ParserResult variable while saving its value for the result. + 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) { + GenerateError( + "This file is corrupt: it uses both new and old style varargs"); + return 0; + } + + if(ObsoleteVarArgs) { + if(Function* F = Result->getNamedFunction("llvm.va_start")) { + if (F->arg_size() != 0) { + GenerateError("Obsolete va_start takes 0 argument!"); + return 0; + } + + //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, (Type *)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) { + GenerateError("Obsolete va_end takes 1 argument!"); + return 0; + } + + //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, (Type *)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) { + GenerateError("Obsolete va_copy takes 1 argument!"); + return 0; + } + //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, + (Type *)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 *RunVMAsmParser(const string &Filename, FILE *F) { - llvmAsmin = F; +Module *llvm::RunVMAsmParser(const std::string &Filename, FILE *F) { + set_scan_file(F); + CurFilename = Filename; - llvmAsmlineno = 1; // Reset the current line number... + return RunParser(new Module(CurFilename)); +} - CurModule.CurrentModule = new Module(); // Allocate a new module to read - yyparse(); // Parse the file. - Module *Result = ParserResult; - llvmAsmin = stdin; // F is about to go away, don't use it anymore... - ParserResult = 0; +Module *llvm::RunVMAsmParser(const char * AsmString, Module * M) { + set_scan_string(AsmString); - return Result; + CurFilename = "from_memory"; + if (M == NULL) { + return RunParser(new Module (CurFilename)); + } else { + return RunParser(M); + } } %} %union { - Module *ModuleVal; - Method *MethodVal; - MethodArgument *MethArgVal; - BasicBlock *BasicBlockVal; - TerminatorInst *TermInstVal; - Instruction *InstVal; - ConstPoolVal *ConstVal; - - const Type *PrimType; - PATypeHolder<Type> *TypeVal; - PATypeHolder<ArrayType> *ArrayTypeTy; - PATypeHolder<StructType> *StructTypeTy; - Value *ValueVal; - - list<MethodArgument*> *MethodArgList; - list<Value*> *ValueList; - list<PATypeHolder<Type> > *TypeList; - list<pair<Value*, BasicBlock*> > *PHIList; // Represent the RHS of PHI node - list<pair<ConstPoolVal*, BasicBlock*> > *JumpTable; - vector<ConstPoolVal*> *ConstVector; - + 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; @@ -525,31 +1044,38 @@ Module *RunVMAsmParser(const string &Filename, FILE *F) { bool BoolVal; char *StrVal; // This memory is strdup'd! - ValID ValIDVal; // strdup'd memory maybe! + llvm::ValID ValIDVal; // strdup'd memory maybe! - Instruction::UnaryOps UnaryOpVal; - Instruction::BinaryOps BinaryOpVal; - Instruction::TermOps TermOpVal; - Instruction::MemoryOps MemOpVal; - Instruction::OtherOps OtherOpVal; + BinaryOpInfo BinaryOpVal; + TermOpInfo TermOpVal; + MemOpInfo MemOpVal; + OtherOpInfo OtherOpVal; + llvm::Module::Endianness Endianness; } -%type <ModuleVal> Module MethodList -%type <MethodVal> Method MethodProto MethodHeader BasicBlockList +%type <ModuleVal> Module FunctionList +%type <FunctionVal> Function FunctionProto FunctionHeader BasicBlockList %type <BasicBlockVal> BasicBlock InstructionList %type <TermInstVal> BBTerminatorInst %type <InstVal> Inst InstVal MemoryInst -%type <ConstVal> ConstVal ExtendedConstVal -%type <ConstVector> ConstVector UByteList -%type <MethodArgList> ArgList ArgListH -%type <MethArgVal> ArgVal +%type <ConstVal> ConstVal ConstExpr +%type <ConstVector> ConstVector +%type <ArgList> ArgList ArgListH +%type <ArgVal> ArgVal %type <PHIList> PHIList %type <ValueList> ValueRefList ValueRefListE // For call param lists +%type <ValueList> IndexList // For GEP derived indices %type <TypeList> TypeListI ArgTypeListI %type <JumpTable> JumpTable %type <BoolVal> GlobalType // GLOBAL or CONSTANT? - -%type <ValIDVal> ValueRef ConstValueRef // Reference to a definition or BB +%type <BoolVal> OptVolatile // 'volatile' or not +%type <BoolVal> OptTailCall // TAIL CALL or plain CALL. +%type <BoolVal> OptSideEffect // 'sideeffect' or not. +%type <Linkage> OptLinkage +%type <Endianness> BigOrLittle + +// ValueRef - Unresolved reference to a definition or BB +%type <ValIDVal> ValueRef ConstValueRef SymbolicValueRef %type <ValueVal> ResolvedVal // <type> <valref> pair // Tokens and types for handling constant integer values // @@ -568,346 +1094,679 @@ Module *RunVMAsmParser(const string &Filename, FILE *F) { // Built in types... %type <TypeVal> Types TypesV UpRTypes UpRTypesV %type <PrimType> SIntType UIntType IntType FPType PrimType // Classifications -%token <TypeVal> OPAQUE %token <PrimType> VOID BOOL SBYTE UBYTE SHORT USHORT INT UINT LONG ULONG %token <PrimType> FLOAT DOUBLE TYPE LABEL -%type <ArrayTypeTy> ArrayType ArrayTypeI -%type <StructTypeTy> StructType StructTypeI - -%token <StrVal> VAR_ID LABELSTR STRINGCONSTANT -%type <StrVal> OptVAR_ID OptAssign - - -%token IMPLEMENTATION TRUE FALSE BEGINTOK END DECLARE GLOBAL CONSTANT UNINIT -%token TO DOTDOTDOT STRING -// Basic Block Terminating Operators -%token <TermOpVal> RET BR SWITCH - -// Unary Operators -%type <UnaryOpVal> UnaryOps // all the unary operators -%token <UnaryOpVal> NOT - -// Binary Operators -%type <BinaryOpVal> BinaryOps // all the binary operators -%token <BinaryOpVal> ADD SUB MUL DIV REM -%token <BinaryOpVal> SETLE SETGE SETLT SETGT SETEQ SETNE // Binary Comarators +%token <StrVal> VAR_ID LABELSTR STRINGCONSTANT +%type <StrVal> Name OptName OptAssign +%type <UIntVal> OptAlign OptCAlign +%type <StrVal> OptSection SectionString + +%token IMPLEMENTATION ZEROINITIALIZER TRUETOK FALSETOK BEGINTOK ENDTOK +%token DECLARE GLOBAL CONSTANT SECTION VOLATILE +%token TO DOTDOTDOT NULL_TOK UNDEF CONST INTERNAL LINKONCE WEAK APPENDING +%token DLLIMPORT DLLEXPORT EXTERN_WEAK +%token OPAQUE NOT EXTERNAL TARGET TRIPLE ENDIAN POINTERSIZE LITTLE BIG ALIGN +%token DEPLIBS CALL TAIL ASM_TOK MODULE SIDEEFFECT +%token CC_TOK CCC_TOK CSRETCC_TOK FASTCC_TOK COLDCC_TOK +%token X86_STDCALLCC_TOK X86_FASTCALLCC_TOK +%token DATALAYOUT +%type <UIntVal> OptCallingConv + +// Basic Block Terminating Operators +%token <TermOpVal> RET BR SWITCH INVOKE UNWIND UNREACHABLE + +// Binary Operators +%type <BinaryOpVal> ArithmeticOps LogicalOps SetCondOps // Binops Subcatagories +%token <BinaryOpVal> ADD SUB MUL UDIV SDIV FDIV UREM SREM FREM AND OR XOR +%token <BinaryOpVal> SETLE SETGE SETLT SETGT SETEQ SETNE // Binary Comparators // Memory Instructions -%token <MemoryOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR +%token <MemOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR // Other Operators %type <OtherOpVal> ShiftOps -%token <OtherOpVal> PHI CALL CAST SHL SHR +%token <OtherOpVal> PHI_TOK CAST SELECT SHL SHR VAARG +%token <OtherOpVal> EXTRACTELEMENT INSERTELEMENT SHUFFLEVECTOR +%token VAARG_old VANEXT_old //OBSOLETE + %start Module %% // Handle constant integer size restriction and conversion... // - -INTVAL : SINTVAL +INTVAL : SINTVAL; INTVAL : UINTVAL { if ($1 > (uint32_t)INT32_MAX) // Outside of my range! - ThrowException("Value too large for type!"); + GEN_ERROR("Value too large for type!"); $$ = (int32_t)$1; -} + CHECK_FOR_ERROR +}; -EINT64VAL : ESINT64VAL // These have same type and can't cause problems... +EINT64VAL : ESINT64VAL; // These have same type and can't cause problems... EINT64VAL : EUINT64VAL { if ($1 > (uint64_t)INT64_MAX) // Outside of my range! - ThrowException("Value too large for type!"); + GEN_ERROR("Value too large for type!"); $$ = (int64_t)$1; -} + CHECK_FOR_ERROR +}; -// Operations that are notably excluded from this list include: +// Operations that are notably excluded from this list include: // RET, BR, & SWITCH because they end basic blocks and are treated specially. // -UnaryOps : NOT -BinaryOps : ADD | SUB | MUL | DIV | REM -BinaryOps : SETLE | SETGE | SETLT | SETGT | SETEQ | SETNE -ShiftOps : SHL | SHR +ArithmeticOps: ADD | SUB | MUL | UDIV | SDIV | FDIV | UREM | SREM | FREM; +LogicalOps : AND | OR | XOR; +SetCondOps : SETLE | SETGE | SETLT | SETGT | SETEQ | SETNE; + +ShiftOps : SHL | SHR; // These are some types that allow classification if we only want a particular // thing... for example, only a signed, unsigned, or integral type. -SIntType : LONG | INT | SHORT | SBYTE -UIntType : ULONG | UINT | USHORT | UBYTE -IntType : SIntType | UIntType -FPType : FLOAT | DOUBLE +SIntType : LONG | INT | SHORT | SBYTE; +UIntType : ULONG | UINT | USHORT | UBYTE; +IntType : SIntType | UIntType; +FPType : FLOAT | DOUBLE; // OptAssign - Value producing statements have an optional assignment component -OptAssign : VAR_ID '=' { +OptAssign : Name '=' { $$ = $1; + CHECK_FOR_ERROR } - | /*empty*/ { - $$ = 0; - } + | /*empty*/ { + $$ = 0; + CHECK_FOR_ERROR + }; + +OptLinkage : INTERNAL { $$ = GlobalValue::InternalLinkage; } | + LINKONCE { $$ = GlobalValue::LinkOnceLinkage; } | + WEAK { $$ = GlobalValue::WeakLinkage; } | + APPENDING { $$ = GlobalValue::AppendingLinkage; } | + DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; } | + DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; } | + EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; } | + /*empty*/ { $$ = GlobalValue::ExternalLinkage; }; + +OptCallingConv : /*empty*/ { $$ = CallingConv::C; } | + CCC_TOK { $$ = CallingConv::C; } | + CSRETCC_TOK { $$ = CallingConv::CSRet; } | + FASTCC_TOK { $$ = CallingConv::Fast; } | + COLDCC_TOK { $$ = CallingConv::Cold; } | + X86_STDCALLCC_TOK { $$ = CallingConv::X86_StdCall; } | + X86_FASTCALLCC_TOK { $$ = CallingConv::X86_FastCall; } | + CC_TOK EUINT64VAL { + if ((unsigned)$2 != $2) + GEN_ERROR("Calling conv too large!"); + $$ = $2; + CHECK_FOR_ERROR + }; + +// OptAlign/OptCAlign - An optional alignment, and an optional alignment with +// a comma before it. +OptAlign : /*empty*/ { $$ = 0; } | + ALIGN EUINT64VAL { + $$ = $2; + if ($$ != 0 && !isPowerOf2_32($$)) + GEN_ERROR("Alignment must be a power of two!"); + CHECK_FOR_ERROR +}; +OptCAlign : /*empty*/ { $$ = 0; } | + ',' ALIGN EUINT64VAL { + $$ = $3; + if ($$ != 0 && !isPowerOf2_32($$)) + GEN_ERROR("Alignment must be a power of two!"); + CHECK_FOR_ERROR +}; + + +SectionString : SECTION STRINGCONSTANT { + for (unsigned i = 0, e = strlen($2); i != e; ++i) + if ($2[i] == '"' || $2[i] == '\\') + GEN_ERROR("Invalid character in section name!"); + $$ = $2; + CHECK_FOR_ERROR +}; + +OptSection : /*empty*/ { $$ = 0; } | + SectionString { $$ = $1; }; +// GlobalVarAttributes - Used to pass the attributes string on a global. CurGV +// is set to be the global we are processing. +// +GlobalVarAttributes : /* empty */ {} | + ',' GlobalVarAttribute GlobalVarAttributes {}; +GlobalVarAttribute : SectionString { + CurGV->setSection($1); + free($1); + CHECK_FOR_ERROR + } + | ALIGN EUINT64VAL { + if ($2 != 0 && !isPowerOf2_32($2)) + GEN_ERROR("Alignment must be a power of two!"); + CurGV->setAlignment($2); + CHECK_FOR_ERROR + }; //===----------------------------------------------------------------------===// // Types includes all predefined types... except void, because it can only be -// used in specific contexts (method returning void for example). To have +// used in specific contexts (function returning void for example). To have // access to it, a user must explicitly use TypesV. // // TypesV includes all of 'Types', but it also includes the void type. -TypesV : Types | VOID { $$ = newTH($1); } -UpRTypesV : UpRTypes | VOID { $$ = newTH($1); } +TypesV : Types | VOID { $$ = new PATypeHolder($1); }; +UpRTypesV : UpRTypes | VOID { $$ = new PATypeHolder($1); }; Types : UpRTypes { - TypeDone($$ = $1); - } + if (!UpRefs.empty()) + GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription()); + $$ = $1; + CHECK_FOR_ERROR + }; // Derived types are added later... // -PrimType : BOOL | SBYTE | UBYTE | SHORT | USHORT | INT | UINT -PrimType : LONG | ULONG | FLOAT | DOUBLE | TYPE | LABEL -UpRTypes : OPAQUE | PrimType { $$ = newTH($1); } -UpRTypes : ValueRef { // Named types are also simple types... - $$ = newTH(getTypeVal($1)); -} - -// ArrayTypeI - Internal version of ArrayType that can have incomplete uprefs -// -ArrayTypeI : '[' UpRTypesV ']' { // Unsized array type? - $$ = newTHC<ArrayType>(HandleUpRefs(ArrayType::get(*$2))); - delete $2; - } - | '[' EUINT64VAL 'x' UpRTypes ']' { // Sized array type? - $$ = newTHC<ArrayType>(HandleUpRefs(ArrayType::get(*$4, (int)$2))); - delete $4; - } - -StructTypeI : '{' TypeListI '}' { // Structure type? - vector<const Type*> Elements; - mapto($2->begin(), $2->end(), back_inserter(Elements), - mem_fun_ref(&PATypeHandle<Type>::get)); - - $$ = newTHC<StructType>(HandleUpRefs(StructType::get(Elements))); - delete $2; - } - | '{' '}' { // Empty structure type? - $$ = newTH(StructType::get(vector<const Type*>())); - } - +PrimType : BOOL | SBYTE | UBYTE | SHORT | USHORT | INT | UINT ; +PrimType : LONG | ULONG | FLOAT | DOUBLE | TYPE | LABEL; +UpRTypes : OPAQUE { + $$ = new PATypeHolder(OpaqueType::get()); + CHECK_FOR_ERROR + } + | PrimType { + $$ = new PATypeHolder($1); + CHECK_FOR_ERROR + }; +UpRTypes : SymbolicValueRef { // Named types are also simple types... + const Type* tmp = getTypeVal($1); + CHECK_FOR_ERROR + $$ = new PATypeHolder(tmp); +}; // Include derived types in the Types production. // UpRTypes : '\\' EUINT64VAL { // Type UpReference - if ($2 > (uint64_t)INT64_MAX) ThrowException("Value out of range!"); + if ($2 > (uint64_t)~0U) GEN_ERROR("Value out of range!"); OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder - UpRefs.push_back(make_pair((unsigned)$2, OT)); // Add to vector... - $$ = newTH<Type>(OT); + UpRefs.push_back(UpRefRecord((unsigned)$2, OT)); // Add to vector... + $$ = new PATypeHolder(OT); UR_OUT("New Upreference!\n"); + CHECK_FOR_ERROR } - | UpRTypesV '(' ArgTypeListI ')' { // Method derived type? - vector<const Type*> Params; - mapto($3->begin(), $3->end(), back_inserter(Params), - mem_fun_ref(&PATypeHandle<Type>::get)); - $$ = newTH(HandleUpRefs(MethodType::get(*$1, Params))); + | UpRTypesV '(' ArgTypeListI ')' { // Function derived type? + std::vector<const Type*> Params; + for (std::list<llvm::PATypeHolder>::iterator I = $3->begin(), + E = $3->end(); I != E; ++I) + Params.push_back(*I); + bool isVarArg = Params.size() && Params.back() == Type::VoidTy; + if (isVarArg) Params.pop_back(); + + $$ = new PATypeHolder(HandleUpRefs(FunctionType::get(*$1,Params,isVarArg))); delete $3; // Delete the argument list - delete $1; // Delete the old type handle + delete $1; // Delete the return type handle + CHECK_FOR_ERROR } - | ArrayTypeI { // [Un]sized array type? - $$ = newTHC<Type>(*$1); delete $1; + | '[' EUINT64VAL 'x' UpRTypes ']' { // Sized array type? + $$ = new PATypeHolder(HandleUpRefs(ArrayType::get(*$4, (unsigned)$2))); + delete $4; + CHECK_FOR_ERROR + } + | '<' EUINT64VAL 'x' UpRTypes '>' { // Packed array type? + const llvm::Type* ElemTy = $4->get(); + if ((unsigned)$2 != $2) + GEN_ERROR("Unsigned result not equal to signed result"); + if (!ElemTy->isPrimitiveType()) + GEN_ERROR("Elemental type of a PackedType must be primitive"); + if (!isPowerOf2_32($2)) + GEN_ERROR("Vector length should be a power of 2!"); + $$ = new PATypeHolder(HandleUpRefs(PackedType::get(*$4, (unsigned)$2))); + delete $4; + CHECK_FOR_ERROR + } + | '{' TypeListI '}' { // Structure type? + std::vector<const Type*> Elements; + for (std::list<llvm::PATypeHolder>::iterator I = $2->begin(), + E = $2->end(); I != E; ++I) + Elements.push_back(*I); + + $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements))); + delete $2; + CHECK_FOR_ERROR } - | StructTypeI { // Structure type? - $$ = newTHC<Type>(*$1); delete $1; + | '{' '}' { // Empty structure type? + $$ = new PATypeHolder(StructType::get(std::vector<const Type*>())); + CHECK_FOR_ERROR } | UpRTypes '*' { // Pointer type? - $$ = newTH(HandleUpRefs(PointerType::get(*$1))); - delete $1; // Delete the type handle - } - -// Define some helpful top level types that do not allow UpReferences to escape -// -ArrayType : ArrayTypeI { TypeDone($$ = $1); } -StructType : StructTypeI { TypeDone($$ = $1); } - - + if (*$1 == Type::LabelTy) + GEN_ERROR("Cannot form a pointer to a basic block"); + $$ = new PATypeHolder(HandleUpRefs(PointerType::get(*$1))); + delete $1; + CHECK_FOR_ERROR + }; -// TypeList - Used for struct declarations and as a basis for method type +// TypeList - Used for struct declarations and as a basis for function type // declaration type lists // TypeListI : UpRTypes { - $$ = new list<PATypeHolder<Type> >(); + $$ = new std::list<PATypeHolder>(); $$->push_back(*$1); delete $1; + CHECK_FOR_ERROR } | TypeListI ',' UpRTypes { ($$=$1)->push_back(*$3); delete $3; - } + CHECK_FOR_ERROR + }; -// ArgTypeList - List of types for a method type declaration... +// ArgTypeList - List of types for a function type declaration... ArgTypeListI : TypeListI | TypeListI ',' DOTDOTDOT { ($$=$1)->push_back(Type::VoidTy); + CHECK_FOR_ERROR } | DOTDOTDOT { - ($$ = new list<PATypeHolder<Type> >())->push_back(Type::VoidTy); + ($$ = new std::list<PATypeHolder>())->push_back(Type::VoidTy); + CHECK_FOR_ERROR } | /*empty*/ { - $$ = new list<PATypeHolder<Type> >(); - } - + $$ = new std::list<PATypeHolder>(); + CHECK_FOR_ERROR + }; // ConstVal - The various declarations that go into the constant pool. This -// includes all forward declarations of types, constants, and functions. -// -// This is broken into two sections: ExtendedConstVal and ConstVal +// production is used ONLY to represent constants that show up AFTER a 'const', +// 'constant' or 'global' token at global scope. Constants that can be inlined +// into other expressions (such as integers and constexprs) are handled by the +// ResolvedVal, ValueRef and ConstValueRef productions. // -ExtendedConstVal: ArrayType '[' ConstVector ']' { // Nonempty unsized arr - const ArrayType *ATy = *$1; +ConstVal: Types '[' ConstVector ']' { // Nonempty unsized arr + const ArrayType *ATy = dyn_cast<ArrayType>($1->get()); + if (ATy == 0) + GEN_ERROR("Cannot make array constant with type: '" + + (*$1)->getDescription() + "'!"); const Type *ETy = ATy->getElementType(); int NumElements = ATy->getNumElements(); // Verify that we have the correct size... if (NumElements != -1 && NumElements != (int)$3->size()) - ThrowException("Type mismatch: constant sized array initialized with " + - utostr($3->size()) + " arguments, but has size of " + - itostr(NumElements) + "!"); + GEN_ERROR("Type mismatch: constant sized array initialized with " + + utostr($3->size()) + " arguments, but has size of " + + itostr(NumElements) + "!"); // Verify all elements are correct type! for (unsigned i = 0; i < $3->size(); i++) { if (ETy != (*$3)[i]->getType()) - ThrowException("Element #" + utostr(i) + " is not of type '" + - ETy->getName() + "' as required!\nIt is of type '" + - (*$3)[i]->getType()->getName() + "'."); + GEN_ERROR("Element #" + utostr(i) + " is not of type '" + + ETy->getDescription() +"' as required!\nIt is of type '"+ + (*$3)[i]->getType()->getDescription() + "'."); } - $$ = ConstPoolArray::get(ATy, *$3); + $$ = ConstantArray::get(ATy, *$3); delete $1; delete $3; + CHECK_FOR_ERROR } - | ArrayType '[' ']' { - int NumElements = (*$1)->getNumElements(); + | Types '[' ']' { + const ArrayType *ATy = dyn_cast<ArrayType>($1->get()); + if (ATy == 0) + GEN_ERROR("Cannot make array constant with type: '" + + (*$1)->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) +"!"); - $$ = ConstPoolArray::get((*$1), vector<ConstPoolVal*>()); + GEN_ERROR("Type mismatch: constant sized array initialized with 0" + " arguments, but has size of " + itostr(NumElements) +"!"); + $$ = ConstantArray::get(ATy, std::vector<Constant*>()); delete $1; + CHECK_FOR_ERROR } - | ArrayType 'c' STRINGCONSTANT { - const ArrayType *ATy = *$1; + | Types 'c' STRINGCONSTANT { + const ArrayType *ATy = dyn_cast<ArrayType>($1->get()); + if (ATy == 0) + GEN_ERROR("Cannot make array constant with type: '" + + (*$1)->getDescription() + "'!"); + int NumElements = ATy->getNumElements(); const Type *ETy = ATy->getElementType(); char *EndStr = UnEscapeLexed($3, true); if (NumElements != -1 && NumElements != (EndStr-$3)) - ThrowException("Can't build string constant of size " + - itostr((int)(EndStr-$3)) + - " when array has size " + itostr(NumElements) + "!"); - vector<ConstPoolVal*> Vals; + GEN_ERROR("Can't build string constant of size " + + itostr((int)(EndStr-$3)) + + " when array has size " + itostr(NumElements) + "!"); + std::vector<Constant*> Vals; if (ETy == Type::SByteTy) { - for (char *C = $3; C != EndStr; ++C) - Vals.push_back(ConstPoolSInt::get(ETy, *C)); + for (signed char *C = (signed char *)$3; C != (signed char *)EndStr; ++C) + Vals.push_back(ConstantInt::get(ETy, *C)); } else if (ETy == Type::UByteTy) { - for (char *C = $3; C != EndStr; ++C) - Vals.push_back(ConstPoolUInt::get(ETy, *C)); + for (unsigned char *C = (unsigned char *)$3; + C != (unsigned char*)EndStr; ++C) + Vals.push_back(ConstantInt::get(ETy, *C)); } else { free($3); - ThrowException("Cannot build string arrays of non byte sized elements!"); + GEN_ERROR("Cannot build string arrays of non byte sized elements!"); } free($3); - $$ = ConstPoolArray::get(ATy, Vals); + $$ = ConstantArray::get(ATy, Vals); delete $1; + CHECK_FOR_ERROR } - | StructType '{' ConstVector '}' { - // FIXME: TODO: Check to see that the constants are compatible with the type - // initializer! - $$ = ConstPoolStruct::get(*$1, *$3); + | Types '<' ConstVector '>' { // Nonempty unsized arr + const PackedType *PTy = dyn_cast<PackedType>($1->get()); + if (PTy == 0) + GEN_ERROR("Cannot make packed constant with type: '" + + (*$1)->getDescription() + "'!"); + const Type *ETy = PTy->getElementType(); + int NumElements = PTy->getNumElements(); + + // Verify that we have the correct size... + if (NumElements != -1 && NumElements != (int)$3->size()) + GEN_ERROR("Type mismatch: constant sized packed initialized with " + + utostr($3->size()) + " arguments, but has size of " + + itostr(NumElements) + "!"); + + // Verify all elements are correct type! + for (unsigned i = 0; i < $3->size(); i++) { + if (ETy != (*$3)[i]->getType()) + GEN_ERROR("Element #" + utostr(i) + " is not of type '" + + ETy->getDescription() +"' as required!\nIt is of type '"+ + (*$3)[i]->getType()->getDescription() + "'."); + } + + $$ = ConstantPacked::get(PTy, *$3); delete $1; delete $3; + CHECK_FOR_ERROR + } + | Types '{' ConstVector '}' { + const StructType *STy = dyn_cast<StructType>($1->get()); + if (STy == 0) + GEN_ERROR("Cannot make struct constant with type: '" + + (*$1)->getDescription() + "'!"); + + if ($3->size() != STy->getNumContainedTypes()) + GEN_ERROR("Illegal number of initializers for structure type!"); + + // Check to ensure that constants are compatible with the type initializer! + for (unsigned i = 0, e = $3->size(); i != e; ++i) + if ((*$3)[i]->getType() != STy->getElementType(i)) + GEN_ERROR("Expected type '" + + STy->getElementType(i)->getDescription() + + "' for element #" + utostr(i) + + " of structure initializer!"); + + $$ = ConstantStruct::get(STy, *$3); + delete $1; delete $3; + CHECK_FOR_ERROR } -/* - | Types '*' ConstVal { - assert(0); - $$ = 0; - } -*/ + | Types '{' '}' { + const StructType *STy = dyn_cast<StructType>($1->get()); + if (STy == 0) + GEN_ERROR("Cannot make struct constant with type: '" + + (*$1)->getDescription() + "'!"); -ConstVal : ExtendedConstVal { - $$ = $1; - } - | SIntType EINT64VAL { // integral constants - if (!ConstPoolSInt::isValueValidForType($1, $2)) - ThrowException("Constant value doesn't fit in type!"); - $$ = ConstPoolSInt::get($1, $2); - } - | UIntType EUINT64VAL { // integral constants - if (!ConstPoolUInt::isValueValidForType($1, $2)) - ThrowException("Constant value doesn't fit in type!"); - $$ = ConstPoolUInt::get($1, $2); - } - | BOOL TRUE { // Boolean constants - $$ = ConstPoolBool::True; - } - | BOOL FALSE { // Boolean constants - $$ = ConstPoolBool::False; - } - | FPType FPVAL { // Float & Double constants - $$ = ConstPoolFP::get($1, $2); - } + if (STy->getNumContainedTypes() != 0) + GEN_ERROR("Illegal number of initializers for structure type!"); -// ConstVector - A list of comma seperated constants. -ConstVector : ConstVector ',' ConstVal { - ($$ = $1)->push_back($3); + $$ = ConstantStruct::get(STy, std::vector<Constant*>()); + delete $1; + CHECK_FOR_ERROR } - | ConstVal { - $$ = new vector<ConstPoolVal*>(); - $$->push_back($1); + | Types NULL_TOK { + const PointerType *PTy = dyn_cast<PointerType>($1->get()); + if (PTy == 0) + GEN_ERROR("Cannot make null pointer constant with type: '" + + (*$1)->getDescription() + "'!"); + + $$ = ConstantPointerNull::get(PTy); + delete $1; + CHECK_FOR_ERROR } + | Types UNDEF { + $$ = UndefValue::get($1->get()); + delete $1; + CHECK_FOR_ERROR + } + | Types SymbolicValueRef { + const PointerType *Ty = dyn_cast<PointerType>($1->get()); + if (Ty == 0) + GEN_ERROR("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, $2); + CHECK_FOR_ERROR -// GlobalType - Match either GLOBAL or CONSTANT for global declarations... -GlobalType : GLOBAL { $$ = false; } | CONSTANT { $$ = true; } + 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); -// ConstPool - Constants with optional names assigned to them. -ConstPool : ConstPool OptAssign ConstVal { - setValueName($3, $2); - InsertValue($3); - } - | ConstPool OptAssign TYPE TypesV { // Types can be defined in the const pool - // TODO: FIXME when Type are not const - setValueName(const_cast<Type*>($4->get()), $2); + // First check to see if the forward references value is already created! + PerModuleInfo::GlobalRefsType::iterator I = + CurModule.GlobalRefs.find(std::make_pair(PT, $2)); + + if (I != CurModule.GlobalRefs.end()) { + V = I->second; // Placeholder already exists, use it... + $2.destroy(); + } else { + std::string Name; + if ($2.Type == ValID::NameVal) Name = $2.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); + } - if (!$2) { - InsertType($4->get(), - CurMeth.CurrentMethod ? CurMeth.Types : CurModule.Types); + // Keep track of the fact that we have a forward ref to recycle it + CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, $2), GV)); + V = GV; + } } - delete $4; + + $$ = cast<GlobalValue>(V); + delete $1; // Free the type handle + CHECK_FOR_ERROR } - | ConstPool MethodProto { // Method prototypes can be in const pool + | Types ConstExpr { + if ($1->get() != $2->getType()) + GEN_ERROR("Mismatched types for constant expression!"); + $$ = $2; + delete $1; + CHECK_FOR_ERROR } - | ConstPool OptAssign GlobalType ResolvedVal { - const Type *Ty = $4->getType(); - // Global declarations appear in Constant Pool - ConstPoolVal *Initializer = $4->castConstant(); - if (Initializer == 0) - ThrowException("Global value initializer is not a constant!"); - - GlobalVariable *GV = new GlobalVariable(PointerType::get(Ty), $3, - Initializer); - setValueName(GV, $2); + | Types ZEROINITIALIZER { + const Type *Ty = $1->get(); + if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty)) + GEN_ERROR("Cannot create a null initialized value of this type!"); + $$ = Constant::getNullValue(Ty); + delete $1; + CHECK_FOR_ERROR + }; - CurModule.CurrentModule->getGlobalList().push_back(GV); - InsertValue(GV, CurModule.Values); +ConstVal : SIntType EINT64VAL { // integral constants + if (!ConstantInt::isValueValidForType($1, $2)) + GEN_ERROR("Constant value doesn't fit in type!"); + $$ = ConstantInt::get($1, $2); + CHECK_FOR_ERROR } - | ConstPool OptAssign UNINIT GlobalType Types { - const Type *Ty = *$5; - // Global declarations appear in Constant Pool - if (Ty->isArrayType() && Ty->castArrayType()->isUnsized()) { - ThrowException("Type '" + Ty->getDescription() + - "' is not a sized type!"); - } + | UIntType EUINT64VAL { // integral constants + if (!ConstantInt::isValueValidForType($1, $2)) + GEN_ERROR("Constant value doesn't fit in type!"); + $$ = ConstantInt::get($1, $2); + CHECK_FOR_ERROR + } + | BOOL TRUETOK { // Boolean constants + $$ = ConstantBool::getTrue(); + CHECK_FOR_ERROR + } + | BOOL FALSETOK { // Boolean constants + $$ = ConstantBool::getFalse(); + CHECK_FOR_ERROR + } + | FPType FPVAL { // Float & Double constants + if (!ConstantFP::isValueValidForType($1, $2)) + GEN_ERROR("Floating point constant invalid for type!!"); + $$ = ConstantFP::get($1, $2); + CHECK_FOR_ERROR + }; + + +ConstExpr: CAST '(' ConstVal TO Types ')' { + if (!$3->getType()->isFirstClassType()) + GEN_ERROR("cast constant expression from a non-primitive type: '" + + $3->getType()->getDescription() + "'!"); + if (!$5->get()->isFirstClassType()) + GEN_ERROR("cast constant expression to a non-primitive type: '" + + $5->get()->getDescription() + "'!"); + $$ = ConstantExpr::getCast($3, $5->get()); + delete $5; + CHECK_FOR_ERROR + } + | GETELEMENTPTR '(' ConstVal IndexList ')' { + if (!isa<PointerType>($3->getType())) + GEN_ERROR("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($3->getType(), $4->begin(), $4->end()), + GTE = gep_type_end($3->getType(), $4->begin(), $4->end()); + for (unsigned i = 0, e = $4->size(); i != e && GTI != GTE; ++i, ++GTI) + if (isa<StructType>(*GTI)) // Only change struct indices + if (ConstantInt *CUI = dyn_cast<ConstantInt>((*$4)[i])) + if (CUI->getType() == Type::UByteTy) + (*$4)[i] = ConstantExpr::getCast(CUI, Type::UIntTy); + + const Type *IdxTy = + GetElementPtrInst::getIndexedType($3->getType(), *$4, true); + if (!IdxTy) + GEN_ERROR("Index list invalid for constant getelementptr!"); + + std::vector<Constant*> IdxVec; + for (unsigned i = 0, e = $4->size(); i != e; ++i) + if (Constant *C = dyn_cast<Constant>((*$4)[i])) + IdxVec.push_back(C); + else + GEN_ERROR("Indices to constant getelementptr must be constants!"); - GlobalVariable *GV = new GlobalVariable(PointerType::get(Ty), $4); - setValueName(GV, $2); + delete $4; - CurModule.CurrentModule->getGlobalList().push_back(GV); - InsertValue(GV, CurModule.Values); - } - | /* empty: end of list */ { + $$ = ConstantExpr::getGetElementPtr($3, IdxVec); + CHECK_FOR_ERROR + } + | SELECT '(' ConstVal ',' ConstVal ',' ConstVal ')' { + if ($3->getType() != Type::BoolTy) + GEN_ERROR("Select condition must be of boolean type!"); + if ($5->getType() != $7->getType()) + GEN_ERROR("Select operand types must match!"); + $$ = ConstantExpr::getSelect($3, $5, $7); + CHECK_FOR_ERROR + } + | ArithmeticOps '(' ConstVal ',' ConstVal ')' { + if ($3->getType() != $5->getType()) + GEN_ERROR("Binary operator types must match!"); + // First, make sure we're dealing with the right opcode by upgrading from + // obsolete versions. + sanitizeOpCode($1,$3->getType()); + CHECK_FOR_ERROR; + + // 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>($3->getType())) { + $$ = ConstantExpr::get($1.opcode, $3, $5); + } else { + const Type *IntPtrTy = 0; + switch (CurModule.CurrentModule->getPointerSize()) { + case Module::Pointer32: IntPtrTy = Type::IntTy; break; + case Module::Pointer64: IntPtrTy = Type::LongTy; break; + default: GEN_ERROR("invalid pointer binary constant expr!"); + } + $$ = ConstantExpr::get($1.opcode, ConstantExpr::getCast($3, IntPtrTy), + ConstantExpr::getCast($5, IntPtrTy)); + $$ = ConstantExpr::getCast($$, $3->getType()); + } + CHECK_FOR_ERROR + } + | LogicalOps '(' ConstVal ',' ConstVal ')' { + if ($3->getType() != $5->getType()) + GEN_ERROR("Logical operator types must match!"); + if (!$3->getType()->isIntegral()) { + if (!isa<PackedType>($3->getType()) || + !cast<PackedType>($3->getType())->getElementType()->isIntegral()) + GEN_ERROR("Logical operator requires integral operands!"); + } + $$ = ConstantExpr::get($1.opcode, $3, $5); + CHECK_FOR_ERROR + } + | SetCondOps '(' ConstVal ',' ConstVal ')' { + if ($3->getType() != $5->getType()) + GEN_ERROR("setcc operand types must match!"); + $$ = ConstantExpr::get($1.opcode, $3, $5); + CHECK_FOR_ERROR + } + | ShiftOps '(' ConstVal ',' ConstVal ')' { + if ($5->getType() != Type::UByteTy) + GEN_ERROR("Shift count for shift constant must be unsigned byte!"); + if (!$3->getType()->isInteger()) + GEN_ERROR("Shift constant expression requires integer operand!"); + $$ = ConstantExpr::get($1.opcode, $3, $5); + CHECK_FOR_ERROR + } + | EXTRACTELEMENT '(' ConstVal ',' ConstVal ')' { + if (!ExtractElementInst::isValidOperands($3, $5)) + GEN_ERROR("Invalid extractelement operands!"); + $$ = ConstantExpr::getExtractElement($3, $5); + CHECK_FOR_ERROR + } + | INSERTELEMENT '(' ConstVal ',' ConstVal ',' ConstVal ')' { + if (!InsertElementInst::isValidOperands($3, $5, $7)) + GEN_ERROR("Invalid insertelement operands!"); + $$ = ConstantExpr::getInsertElement($3, $5, $7); + CHECK_FOR_ERROR + } + | SHUFFLEVECTOR '(' ConstVal ',' ConstVal ',' ConstVal ')' { + if (!ShuffleVectorInst::isValidOperands($3, $5, $7)) + GEN_ERROR("Invalid shufflevector operands!"); + $$ = ConstantExpr::getShuffleVector($3, $5, $7); + CHECK_FOR_ERROR + }; + + +// ConstVector - A list of comma separated constants. +ConstVector : ConstVector ',' ConstVal { + ($$ = $1)->push_back($3); + CHECK_FOR_ERROR } + | ConstVal { + $$ = new std::vector<Constant*>(); + $$->push_back($1); + CHECK_FOR_ERROR + }; + + +// GlobalType - Match either GLOBAL or CONSTANT for global declarations... +GlobalType : GLOBAL { $$ = false; } | CONSTANT { $$ = true; }; //===----------------------------------------------------------------------===// @@ -917,422 +1776,1052 @@ ConstPool : ConstPool OptAssign ConstVal { // Module rule: Capture the result of parsing the whole file into a result // variable... // -Module : MethodList { +Module : FunctionList { $$ = ParserResult = $1; CurModule.ModuleDone(); -} + CHECK_FOR_ERROR; +}; -// MethodList - A list of methods, preceeded by a constant pool. +// FunctionList - A list of functions, preceeded by a constant pool. // -MethodList : MethodList Method { +FunctionList : FunctionList Function { $$ = $1; - if (!$2->getParent()) - $1->getMethodList().push_back($2); - CurMeth.MethodDone(); + CurFun.FunctionDone(); + CHECK_FOR_ERROR } - | MethodList MethodProto { + | FunctionList FunctionProto { + $$ = $1; + CHECK_FOR_ERROR + } + | FunctionList MODULE ASM_TOK AsmBlock { $$ = $1; + CHECK_FOR_ERROR + } + | FunctionList IMPLEMENTATION { + $$ = $1; + CHECK_FOR_ERROR } - | ConstPool IMPLEMENTATION { + | ConstPool { $$ = CurModule.CurrentModule; - // Resolve circular types before we parse the body of the module - ResolveTypes(CurModule.LateResolveTypes); + // 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) { + GEN_ERROR("Reference to an undefined type: '"+DID.getName() + "'"); + } else { + GEN_ERROR("Reference to an undefined type: #" + itostr(DID.Num)); + } + } + CHECK_FOR_ERROR + }; + +// ConstPool - Constants with optional names assigned to them. +ConstPool : ConstPool OptAssign TYPE TypesV { + // 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($2, *$4); + + if (!setTypeName(*$4, $2) && !$2) { + CHECK_FOR_ERROR + // If this is a named type that is not a redefinition, add it to the slot + // table. + CurModule.Types.push_back(*$4); + } + + delete $4; + CHECK_FOR_ERROR + } + | ConstPool FunctionProto { // Function prototypes can be in const pool + CHECK_FOR_ERROR + } + | ConstPool MODULE ASM_TOK AsmBlock { // Asm blocks can be in the const pool + CHECK_FOR_ERROR } + | ConstPool OptAssign OptLinkage GlobalType ConstVal { + if ($5 == 0) + GEN_ERROR("Global value initializer is not a constant!"); + CurGV = ParseGlobalVariable($2, $3, $4, $5->getType(), $5); + CHECK_FOR_ERROR + } GlobalVarAttributes { + CurGV = 0; + } + | ConstPool OptAssign EXTERNAL GlobalType Types { + CurGV = ParseGlobalVariable($2, GlobalValue::ExternalLinkage, $4, *$5, 0); + CHECK_FOR_ERROR + delete $5; + } GlobalVarAttributes { + CurGV = 0; + CHECK_FOR_ERROR + } + | ConstPool OptAssign DLLIMPORT GlobalType Types { + CurGV = ParseGlobalVariable($2, GlobalValue::DLLImportLinkage, $4, *$5, 0); + CHECK_FOR_ERROR + delete $5; + } GlobalVarAttributes { + CurGV = 0; + CHECK_FOR_ERROR + } + | ConstPool OptAssign EXTERN_WEAK GlobalType Types { + CurGV = + ParseGlobalVariable($2, GlobalValue::ExternalWeakLinkage, $4, *$5, 0); + CHECK_FOR_ERROR + delete $5; + } GlobalVarAttributes { + CurGV = 0; + CHECK_FOR_ERROR + } + | ConstPool TARGET TargetDefinition { + CHECK_FOR_ERROR + } + | ConstPool DEPLIBS '=' LibrariesDefinition { + CHECK_FOR_ERROR + } + | /* empty: end of list */ { + }; + + +AsmBlock : STRINGCONSTANT { + const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm(); + char *EndStr = UnEscapeLexed($1, true); + std::string NewAsm($1, EndStr); + free($1); + + if (AsmSoFar.empty()) + CurModule.CurrentModule->setModuleInlineAsm(NewAsm); + else + CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+NewAsm); + CHECK_FOR_ERROR +}; + +BigOrLittle : BIG { $$ = Module::BigEndian; }; +BigOrLittle : LITTLE { $$ = Module::LittleEndian; }; + +TargetDefinition : ENDIAN '=' BigOrLittle { + CurModule.CurrentModule->setEndianness($3); + CHECK_FOR_ERROR + } + | POINTERSIZE '=' EUINT64VAL { + if ($3 == 32) + CurModule.CurrentModule->setPointerSize(Module::Pointer32); + else if ($3 == 64) + CurModule.CurrentModule->setPointerSize(Module::Pointer64); + else + GEN_ERROR("Invalid pointer size: '" + utostr($3) + "'!"); + CHECK_FOR_ERROR + } + | TRIPLE '=' STRINGCONSTANT { + CurModule.CurrentModule->setTargetTriple($3); + free($3); + } + | DATALAYOUT '=' STRINGCONSTANT { + CurModule.CurrentModule->setDataLayout($3); + free($3); + }; +LibrariesDefinition : '[' LibList ']'; + +LibList : LibList ',' STRINGCONSTANT { + CurModule.CurrentModule->addLibrary($3); + free($3); + CHECK_FOR_ERROR + } + | STRINGCONSTANT { + CurModule.CurrentModule->addLibrary($1); + free($1); + CHECK_FOR_ERROR + } + | /* empty: end of list */ { + CHECK_FOR_ERROR + } + ; //===----------------------------------------------------------------------===// -// Rules to match Method Headers +// Rules to match Function Headers //===----------------------------------------------------------------------===// -OptVAR_ID : VAR_ID | /*empty*/ { $$ = 0; } +Name : VAR_ID | STRINGCONSTANT; +OptName : Name | /*empty*/ { $$ = 0; }; -ArgVal : Types OptVAR_ID { - $$ = new MethodArgument(*$1); delete $1; - setValueName($$, $2); -} +ArgVal : Types OptName { + if (*$1 == Type::VoidTy) + GEN_ERROR("void typed arguments are invalid!"); + $$ = new std::pair<PATypeHolder*, char*>($1, $2); + CHECK_FOR_ERROR +}; -ArgListH : ArgVal ',' ArgListH { - $$ = $3; - $3->push_front($1); +ArgListH : ArgListH ',' ArgVal { + $$ = $1; + $1->push_back(*$3); + delete $3; + CHECK_FOR_ERROR } | ArgVal { - $$ = new list<MethodArgument*>(); - $$->push_front($1); - } - | DOTDOTDOT { - $$ = new list<MethodArgument*>(); - $$->push_back(new MethodArgument(Type::VoidTy)); - } + $$ = new std::vector<std::pair<PATypeHolder*,char*> >(); + $$->push_back(*$1); + delete $1; + CHECK_FOR_ERROR + }; ArgList : ArgListH { $$ = $1; + CHECK_FOR_ERROR + } + | ArgListH ',' DOTDOTDOT { + $$ = $1; + $$->push_back(std::pair<PATypeHolder*, + char*>(new PATypeHolder(Type::VoidTy), 0)); + CHECK_FOR_ERROR + } + | DOTDOTDOT { + $$ = new std::vector<std::pair<PATypeHolder*,char*> >(); + $$->push_back(std::make_pair(new PATypeHolder(Type::VoidTy), (char*)0)); + CHECK_FOR_ERROR } | /* empty */ { $$ = 0; - } - -MethodHeaderH : TypesV STRINGCONSTANT '(' ArgList ')' { - UnEscapeLexed($2); - vector<const Type*> ParamTypeList; - if ($4) - for (list<MethodArgument*>::iterator I = $4->begin(); I != $4->end(); ++I) - ParamTypeList.push_back((*I)->getType()); - - const MethodType *MT = MethodType::get(*$1, ParamTypeList); - delete $1; - - Method *M = 0; - if (SymbolTable *ST = CurModule.CurrentModule->getSymbolTable()) { - if (Value *V = ST->lookup(MT, $2)) { // Method already in symtab? - M = V->castMethodAsserting(); - - // Yes it is. If this is the case, either we need to be a forward decl, - // or it needs to be. - if (!CurMeth.isDeclare && !M->isExternal()) - ThrowException("Redefinition of method '" + string($2) + "'!"); + CHECK_FOR_ERROR + }; + +FunctionHeaderH : OptCallingConv TypesV Name '(' ArgList ')' + OptSection OptAlign { + UnEscapeLexed($3); + std::string FunctionName($3); + free($3); // Free strdup'd memory! + + if (!(*$2)->isFirstClassType() && *$2 != Type::VoidTy) + GEN_ERROR("LLVM functions cannot return aggregate types!"); + + std::vector<const Type*> ParamTypeList; + if ($5) { // If there are arguments... + for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = $5->begin(); + I != $5->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(*$2, ParamTypeList, isVarArg); + const PointerType *PFT = PointerType::get(FT); + delete $2; + + 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()) + GEN_ERROR("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); + + if (CurFun.isDeclare) { + // If we have declaration, always overwrite linkage. This will allow us to + // correctly handle cases, when pointer to function is passed as argument to + // another function. + Fn->setLinkage(CurFun.Linkage); + } + Fn->setCallingConv($1); + Fn->setAlignment($8); + if ($7) { + Fn->setSection($7); + free($7); + } + + // Add all of the arguments we parsed to the function... + if ($5) { // Is null if empty... + if (isVarArg) { // Nuke the last entry + assert($5->back().first->get() == Type::VoidTy && $5->back().second == 0&& + "Not a varargs marker!"); + delete $5->back().first; + $5->pop_back(); // Delete the last entry + } + Function::arg_iterator ArgIt = Fn->arg_begin(); + for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = $5->begin(); + I != $5->end(); ++I, ++ArgIt) { + delete I->first; // Delete the typeholder... + + setValueName(ArgIt, I->second); // Insert arg into symtab... + CHECK_FOR_ERROR + InsertValue(ArgIt); } - } - if (M == 0) { // Not already defined? - M = new Method(MT, $2); - InsertValue(M, CurModule.Values); + delete $5; // We're now done with the argument list } + CHECK_FOR_ERROR +}; - free($2); // Free strdup'd memory! +BEGIN : BEGINTOK | '{'; // Allow BEGIN or '{' to start a function - CurMeth.MethodStart(M); +FunctionHeader : OptLinkage FunctionHeaderH BEGIN { + $$ = CurFun.CurrentFunction; - // Add all of the arguments we parsed to the method... - if ($4 && !CurMeth.isDeclare) { // Is null if empty... - Method::ArgumentListType &ArgList = M->getArgumentList(); + // Make sure that we keep track of the linkage type even if there was a + // previous "declare". + $$->setLinkage($1); +}; - for (list<MethodArgument*>::iterator I = $4->begin(); I != $4->end(); ++I) { - InsertValue(*I); - ArgList.push_back(*I); - } - delete $4; // We're now done with the argument list - } -} - -MethodHeader : MethodHeaderH ConstPool BEGINTOK { - $$ = CurMeth.CurrentMethod; - - // Resolve circular types before we parse the body of the method. - ResolveTypes(CurMeth.LateResolveTypes); -} +END : ENDTOK | '}'; // Allow end of '}' to end a function -Method : BasicBlockList END { +Function : BasicBlockList END { $$ = $1; -} + CHECK_FOR_ERROR +}; -MethodProto : DECLARE { CurMeth.isDeclare = true; } MethodHeaderH { - $$ = CurMeth.CurrentMethod; - if (!$$->getParent()) - CurModule.CurrentModule->getMethodList().push_back($$); - CurMeth.MethodDone(); -} +FnDeclareLinkage: /*default*/ | + DLLIMPORT { CurFun.Linkage = GlobalValue::DLLImportLinkage; } | + EXTERN_WEAK { CurFun.Linkage = GlobalValue::DLLImportLinkage; }; + +FunctionProto : DECLARE { CurFun.isDeclare = true; } FnDeclareLinkage FunctionHeaderH { + $$ = CurFun.CurrentFunction; + CurFun.FunctionDone(); + CHECK_FOR_ERROR + }; //===----------------------------------------------------------------------===// // Rules to match Basic Blocks //===----------------------------------------------------------------------===// +OptSideEffect : /* empty */ { + $$ = false; + CHECK_FOR_ERROR + } + | SIDEEFFECT { + $$ = true; + CHECK_FOR_ERROR + }; + ConstValueRef : ESINT64VAL { // A reference to a direct constant $$ = ValID::create($1); + CHECK_FOR_ERROR } | EUINT64VAL { $$ = ValID::create($1); + CHECK_FOR_ERROR } | FPVAL { // Perhaps it's an FP constant? $$ = ValID::create($1); + CHECK_FOR_ERROR } - | TRUE { - $$ = ValID::create((int64_t)1); + | TRUETOK { + $$ = ValID::create(ConstantBool::getTrue()); + CHECK_FOR_ERROR } - | FALSE { - $$ = ValID::create((int64_t)0); + | FALSETOK { + $$ = ValID::create(ConstantBool::getFalse()); + CHECK_FOR_ERROR + } + | NULL_TOK { + $$ = ValID::createNull(); + CHECK_FOR_ERROR + } + | UNDEF { + $$ = ValID::createUndef(); + CHECK_FOR_ERROR } -/* - | STRINGCONSTANT { // Quoted strings work too... especially for methods - $$ = ValID::create_conststr($1); + | ZEROINITIALIZER { // A vector zero constant. + $$ = ValID::createZeroInit(); + CHECK_FOR_ERROR } -*/ + | '<' ConstVector '>' { // Nonempty unsized packed vector + const Type *ETy = (*$2)[0]->getType(); + int NumElements = $2->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 < $2->size(); i++) { + if (ETy != (*$2)[i]->getType()) + GEN_ERROR("Element #" + utostr(i) + " is not of type '" + + ETy->getDescription() +"' as required!\nIt is of type '" + + (*$2)[i]->getType()->getDescription() + "'."); + } -// ValueRef - A reference to a definition... -ValueRef : INTVAL { // Is it an integer reference...? - $$ = ValID::create($1); + $$ = ValID::create(ConstantPacked::get(pt, *$2)); + delete PTy; delete $2; + CHECK_FOR_ERROR } - | VAR_ID { // Is it a named reference...? + | ConstExpr { $$ = ValID::create($1); + CHECK_FOR_ERROR + } + | ASM_TOK OptSideEffect STRINGCONSTANT ',' STRINGCONSTANT { + char *End = UnEscapeLexed($3, true); + std::string AsmStr = std::string($3, End); + End = UnEscapeLexed($5, true); + std::string Constraints = std::string($5, End); + $$ = ValID::createInlineAsm(AsmStr, Constraints, $2); + free($3); + free($5); + CHECK_FOR_ERROR + }; + +// SymbolicValueRef - Reference to one of two ways of symbolically refering to +// another value. +// +SymbolicValueRef : INTVAL { // Is it an integer reference...? + $$ = ValID::create($1); + CHECK_FOR_ERROR } - | ConstValueRef { - $$ = $1; - } + | Name { // Is it a named reference...? + $$ = ValID::create($1); + CHECK_FOR_ERROR + }; + +// ValueRef - A reference to a definition... either constant or symbolic +ValueRef : SymbolicValueRef | ConstValueRef; + // ResolvedVal - a <type> <value> pair. This is used only in cases where the // type immediately preceeds the value reference, and allows complex constant // pool references (for things like: 'ret [2 x int] [ int 12, int 42]') -ResolvedVal : ExtendedConstVal { - $$ = $1; - } - | Types ValueRef { +ResolvedVal : Types ValueRef { $$ = getVal(*$1, $2); delete $1; - } - + CHECK_FOR_ERROR + }; BasicBlockList : BasicBlockList BasicBlock { - $1->getBasicBlocks().push_back($2); $$ = $1; + CHECK_FOR_ERROR } - | MethodHeader BasicBlock { // Do not allow methods with 0 basic blocks - $$ = $1; // in them... - $1->getBasicBlocks().push_back($2); - } + | FunctionHeader BasicBlock { // Do not allow functions with 0 basic blocks + $$ = $1; + CHECK_FOR_ERROR + }; // Basic blocks are terminated by branching instructions: // br, br/cc, switch, ret // -BasicBlock : InstructionList BBTerminatorInst { - $1->getInstList().push_back($2); +BasicBlock : InstructionList OptAssign BBTerminatorInst { + setValueName($3, $2); + CHECK_FOR_ERROR + InsertValue($3); + + $1->getInstList().push_back($3); InsertValue($1); $$ = $1; - } - | LABELSTR InstructionList BBTerminatorInst { - $2->getInstList().push_back($3); - setValueName($2, $1); - - InsertValue($2); - $$ = $2; - } + CHECK_FOR_ERROR + }; InstructionList : InstructionList Inst { $1->getInstList().push_back($2); $$ = $1; + CHECK_FOR_ERROR } | /* empty */ { - $$ = new BasicBlock(); - } + $$ = CurBB = getBBVal(ValID::create((int)CurFun.NextBBNum++), true); + CHECK_FOR_ERROR + + // 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, $$); + CHECK_FOR_ERROR + } + | LABELSTR { + $$ = CurBB = getBBVal(ValID::create($1), true); + CHECK_FOR_ERROR + + // 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, $$); + CHECK_FOR_ERROR + }; BBTerminatorInst : RET ResolvedVal { // Return with a result... $$ = new ReturnInst($2); + CHECK_FOR_ERROR } | RET VOID { // Return with no result... $$ = new ReturnInst(); + CHECK_FOR_ERROR } | BR LABEL ValueRef { // Unconditional Branch... - $$ = new BranchInst(getVal(Type::LabelTy, $3)->castBasicBlockAsserting()); + BasicBlock* tmpBB = getBBVal($3); + CHECK_FOR_ERROR + $$ = new BranchInst(tmpBB); } // Conditional Branch... | BR BOOL ValueRef ',' LABEL ValueRef ',' LABEL ValueRef { - $$ = new BranchInst(getVal(Type::LabelTy, $6)->castBasicBlockAsserting(), - getVal(Type::LabelTy, $9)->castBasicBlockAsserting(), - getVal(Type::BoolTy, $3)); + BasicBlock* tmpBBA = getBBVal($6); + CHECK_FOR_ERROR + BasicBlock* tmpBBB = getBBVal($9); + CHECK_FOR_ERROR + Value* tmpVal = getVal(Type::BoolTy, $3); + CHECK_FOR_ERROR + $$ = new BranchInst(tmpBBA, tmpBBB, tmpVal); } | SWITCH IntType ValueRef ',' LABEL ValueRef '[' JumpTable ']' { - SwitchInst *S = new SwitchInst(getVal($2, $3), - getVal(Type::LabelTy, $6)->castBasicBlockAsserting()); + Value* tmpVal = getVal($2, $3); + CHECK_FOR_ERROR + BasicBlock* tmpBB = getBBVal($6); + CHECK_FOR_ERROR + SwitchInst *S = new SwitchInst(tmpVal, tmpBB, $8->size()); $$ = S; - list<pair<ConstPoolVal*, BasicBlock*> >::iterator I = $8->begin(), - end = $8->end(); - for (; I != end; ++I) - S->dest_push_back(I->first, I->second); + std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = $8->begin(), + E = $8->end(); + for (; I != E; ++I) { + if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first)) + S->addCase(CI, I->second); + else + GEN_ERROR("Switch case is constant, but not a simple integer!"); + } + delete $8; + CHECK_FOR_ERROR + } + | SWITCH IntType ValueRef ',' LABEL ValueRef '[' ']' { + Value* tmpVal = getVal($2, $3); + CHECK_FOR_ERROR + BasicBlock* tmpBB = getBBVal($6); + CHECK_FOR_ERROR + SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0); + $$ = S; + CHECK_FOR_ERROR } + | INVOKE OptCallingConv TypesV ValueRef '(' ValueRefListE ')' + TO LABEL ValueRef UNWIND LABEL ValueRef { + const PointerType *PFTy; + const FunctionType *Ty; + + if (!(PFTy = dyn_cast<PointerType>($3->get())) || + !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) { + // Pull out the types of all of the arguments... + std::vector<const Type*> ParamTypes; + if ($6) { + for (std::vector<Value*>::iterator I = $6->begin(), E = $6->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($3->get(), ParamTypes, isVarArg); + PFTy = PointerType::get(Ty); + } + + Value *V = getVal(PFTy, $4); // Get the function we're calling... + CHECK_FOR_ERROR + BasicBlock *Normal = getBBVal($10); + CHECK_FOR_ERROR + BasicBlock *Except = getBBVal($13); + CHECK_FOR_ERROR + + // Create the call node... + if (!$6) { // Has no arguments? + $$ = 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 = $6->begin(), ArgE = $6->end(); + + for (; ArgI != ArgE && I != E; ++ArgI, ++I) + if ((*ArgI)->getType() != *I) + GEN_ERROR("Parameter " +(*ArgI)->getName()+ " is not of type '" + + (*I)->getDescription() + "'!"); + + if (I != E || (ArgI != ArgE && !Ty->isVarArg())) + GEN_ERROR("Invalid number of parameters detected!"); + + $$ = new InvokeInst(V, Normal, Except, *$6); + } + cast<InvokeInst>($$)->setCallingConv($2); + + delete $3; + delete $6; + CHECK_FOR_ERROR + } + | UNWIND { + $$ = new UnwindInst(); + CHECK_FOR_ERROR + } + | UNREACHABLE { + $$ = new UnreachableInst(); + CHECK_FOR_ERROR + }; + + JumpTable : JumpTable IntType ConstValueRef ',' LABEL ValueRef { $$ = $1; - ConstPoolVal *V = getVal($2, $3, true)->castConstantAsserting(); + Constant *V = cast<Constant>(getValNonImprovising($2, $3)); + CHECK_FOR_ERROR if (V == 0) - ThrowException("May only switch on a constant pool value!"); + GEN_ERROR("May only switch on a constant pool value!"); - $$->push_back(make_pair(V, getVal($5, $6)->castBasicBlockAsserting())); + BasicBlock* tmpBB = getBBVal($6); + CHECK_FOR_ERROR + $$->push_back(std::make_pair(V, tmpBB)); } | IntType ConstValueRef ',' LABEL ValueRef { - $$ = new list<pair<ConstPoolVal*, BasicBlock*> >(); - ConstPoolVal *V = getVal($1, $2, true)->castConstantAsserting(); + $$ = new std::vector<std::pair<Constant*, BasicBlock*> >(); + Constant *V = cast<Constant>(getValNonImprovising($1, $2)); + CHECK_FOR_ERROR if (V == 0) - ThrowException("May only switch on a constant pool value!"); + GEN_ERROR("May only switch on a constant pool value!"); - $$->push_back(make_pair(V, getVal($4, $5)->castBasicBlockAsserting())); - } + BasicBlock* tmpBB = getBBVal($5); + CHECK_FOR_ERROR + $$->push_back(std::make_pair(V, tmpBB)); + }; Inst : OptAssign InstVal { - setValueName($2, $1); // Is this definition named?? if so, assign the name... - + // Is this definition named?? if so, assign the name... + setValueName($2, $1); + CHECK_FOR_ERROR InsertValue($2); $$ = $2; -} + CHECK_FOR_ERROR +}; PHIList : Types '[' ValueRef ',' ValueRef ']' { // Used for PHI nodes - $$ = new list<pair<Value*, BasicBlock*> >(); - $$->push_back(make_pair(getVal(*$1, $3), - getVal(Type::LabelTy, $5)->castBasicBlockAsserting())); + $$ = new std::list<std::pair<Value*, BasicBlock*> >(); + Value* tmpVal = getVal(*$1, $3); + CHECK_FOR_ERROR + BasicBlock* tmpBB = getBBVal($5); + CHECK_FOR_ERROR + $$->push_back(std::make_pair(tmpVal, tmpBB)); delete $1; } | PHIList ',' '[' ValueRef ',' ValueRef ']' { $$ = $1; - $1->push_back(make_pair(getVal($1->front().first->getType(), $4), - getVal(Type::LabelTy, $6)->castBasicBlockAsserting())); - } + Value* tmpVal = getVal($1->front().first->getType(), $4); + CHECK_FOR_ERROR + BasicBlock* tmpBB = getBBVal($6); + CHECK_FOR_ERROR + $1->push_back(std::make_pair(tmpVal, tmpBB)); + }; ValueRefList : ResolvedVal { // Used for call statements, and memory insts... - $$ = new list<Value*>(); + $$ = new std::vector<Value*>(); $$->push_back($1); } | ValueRefList ',' ResolvedVal { $$ = $1; $1->push_back($3); - } + CHECK_FOR_ERROR + }; // ValueRefListE - Just like ValueRefList, except that it may also be empty! -ValueRefListE : ValueRefList | /*empty*/ { $$ = 0; } - -InstVal : BinaryOps Types ValueRef ',' ValueRef { - $$ = BinaryOperator::create($1, getVal(*$2, $3), getVal(*$2, $5)); +ValueRefListE : ValueRefList | /*empty*/ { $$ = 0; }; + +OptTailCall : TAIL CALL { + $$ = true; + CHECK_FOR_ERROR + } + | CALL { + $$ = false; + CHECK_FOR_ERROR + }; + +InstVal : ArithmeticOps Types ValueRef ',' ValueRef { + if (!(*$2)->isInteger() && !(*$2)->isFloatingPoint() && + !isa<PackedType>((*$2).get())) + GEN_ERROR( + "Arithmetic operator requires integer, FP, or packed operands!"); + if (isa<PackedType>((*$2).get()) && + ($1.opcode == Instruction::URem || + $1.opcode == Instruction::SRem || + $1.opcode == Instruction::FRem)) + GEN_ERROR("U/S/FRem not supported on packed types!"); + // Upgrade the opcode from obsolete versions before we do anything with it. + sanitizeOpCode($1,*$2); + CHECK_FOR_ERROR; + Value* val1 = getVal(*$2, $3); + CHECK_FOR_ERROR + Value* val2 = getVal(*$2, $5); + CHECK_FOR_ERROR + $$ = BinaryOperator::create($1.opcode, val1, val2); if ($$ == 0) - ThrowException("binary operator returned null!"); + GEN_ERROR("binary operator returned null!"); delete $2; } - | UnaryOps ResolvedVal { - $$ = UnaryOperator::create($1, $2); + | LogicalOps Types ValueRef ',' ValueRef { + if (!(*$2)->isIntegral()) { + if (!isa<PackedType>($2->get()) || + !cast<PackedType>($2->get())->getElementType()->isIntegral()) + GEN_ERROR("Logical operator requires integral operands!"); + } + Value* tmpVal1 = getVal(*$2, $3); + CHECK_FOR_ERROR + Value* tmpVal2 = getVal(*$2, $5); + CHECK_FOR_ERROR + $$ = BinaryOperator::create($1.opcode, tmpVal1, tmpVal2); + if ($$ == 0) + GEN_ERROR("binary operator returned null!"); + delete $2; + } + | SetCondOps Types ValueRef ',' ValueRef { + if(isa<PackedType>((*$2).get())) { + GEN_ERROR( + "PackedTypes currently not supported in setcc instructions!"); + } + Value* tmpVal1 = getVal(*$2, $3); + CHECK_FOR_ERROR + Value* tmpVal2 = getVal(*$2, $5); + CHECK_FOR_ERROR + $$ = new SetCondInst($1.opcode, tmpVal1, tmpVal2); + if ($$ == 0) + GEN_ERROR("binary operator returned null!"); + delete $2; + } + | NOT ResolvedVal { + std::cerr << "WARNING: Use of eliminated 'not' instruction:" + << " Replacing with 'xor'.\n"; + + Value *Ones = ConstantIntegral::getAllOnesValue($2->getType()); + if (Ones == 0) + GEN_ERROR("Expected integral type for not instruction!"); + + $$ = BinaryOperator::create(Instruction::Xor, $2, Ones); if ($$ == 0) - ThrowException("unary operator returned null!"); + GEN_ERROR("Could not create a xor instruction!"); + CHECK_FOR_ERROR } | ShiftOps ResolvedVal ',' ResolvedVal { if ($4->getType() != Type::UByteTy) - ThrowException("Shift amount must be ubyte!"); - $$ = new ShiftInst($1, $2, $4); + GEN_ERROR("Shift amount must be ubyte!"); + if (!$2->getType()->isInteger()) + GEN_ERROR("Shift constant expression requires integer operand!"); + $$ = new ShiftInst($1.opcode, $2, $4); + CHECK_FOR_ERROR } | CAST ResolvedVal TO Types { + if (!$4->get()->isFirstClassType()) + GEN_ERROR("cast instruction to a non-primitive type: '" + + $4->get()->getDescription() + "'!"); $$ = new CastInst($2, *$4); delete $4; - } - | PHI PHIList { + CHECK_FOR_ERROR + } + | SELECT ResolvedVal ',' ResolvedVal ',' ResolvedVal { + if ($2->getType() != Type::BoolTy) + GEN_ERROR("select condition must be boolean!"); + if ($4->getType() != $6->getType()) + GEN_ERROR("select value types should match!"); + $$ = new SelectInst($2, $4, $6); + CHECK_FOR_ERROR + } + | VAARG ResolvedVal ',' Types { + NewVarArgs = true; + $$ = new VAArgInst($2, *$4); + delete $4; + CHECK_FOR_ERROR + } + | VAARG_old ResolvedVal ',' Types { + ObsoleteVarArgs = true; + const Type* ArgTy = $2->getType(); + Function* NF = CurModule.CurrentModule-> + getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)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, $2); + CurBB->getInstList().push_back(bar); + CurBB->getInstList().push_back(new StoreInst(bar, foo)); + $$ = new VAArgInst(foo, *$4); + delete $4; + CHECK_FOR_ERROR + } + | VANEXT_old ResolvedVal ',' Types { + ObsoleteVarArgs = true; + const Type* ArgTy = $2->getType(); + Function* NF = CurModule.CurrentModule-> + getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)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, $2); + CurBB->getInstList().push_back(bar); + CurBB->getInstList().push_back(new StoreInst(bar, foo)); + Instruction* tmp = new VAArgInst(foo, *$4); + CurBB->getInstList().push_back(tmp); + $$ = new LoadInst(foo); + delete $4; + CHECK_FOR_ERROR + } + | EXTRACTELEMENT ResolvedVal ',' ResolvedVal { + if (!ExtractElementInst::isValidOperands($2, $4)) + GEN_ERROR("Invalid extractelement operands!"); + $$ = new ExtractElementInst($2, $4); + CHECK_FOR_ERROR + } + | INSERTELEMENT ResolvedVal ',' ResolvedVal ',' ResolvedVal { + if (!InsertElementInst::isValidOperands($2, $4, $6)) + GEN_ERROR("Invalid insertelement operands!"); + $$ = new InsertElementInst($2, $4, $6); + CHECK_FOR_ERROR + } + | SHUFFLEVECTOR ResolvedVal ',' ResolvedVal ',' ResolvedVal { + if (!ShuffleVectorInst::isValidOperands($2, $4, $6)) + GEN_ERROR("Invalid shufflevector operands!"); + $$ = new ShuffleVectorInst($2, $4, $6); + CHECK_FOR_ERROR + } + | PHI_TOK PHIList { const Type *Ty = $2->front().first->getType(); + if (!Ty->isFirstClassType()) + GEN_ERROR("PHI node operands must be of first class type!"); $$ = new PHINode(Ty); + ((PHINode*)$$)->reserveOperandSpace($2->size()); while ($2->begin() != $2->end()) { if ($2->front().first->getType() != Ty) - ThrowException("All elements of a PHI node must be of the same type!"); - ((PHINode*)$$)->addIncoming($2->front().first, $2->front().second); + GEN_ERROR("All elements of a PHI node must be of the same type!"); + cast<PHINode>($$)->addIncoming($2->front().first, $2->front().second); $2->pop_front(); } delete $2; // Free the list... - } - | CALL TypesV ValueRef '(' ValueRefListE ')' { - const MethodType *Ty; + CHECK_FOR_ERROR + } + | OptTailCall OptCallingConv TypesV ValueRef '(' ValueRefListE ')' { + const PointerType *PFTy; + const FunctionType *Ty; - if (!(Ty = (*$2)->dyncastMethodType())) { + if (!(PFTy = dyn_cast<PointerType>($3->get())) || + !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) { // Pull out the types of all of the arguments... - vector<const Type*> ParamTypes; - for (list<Value*>::iterator I = $5->begin(), E = $5->end(); I != E; ++I) - ParamTypes.push_back((*I)->getType()); - Ty = MethodType::get(*$2, ParamTypes); + std::vector<const Type*> ParamTypes; + if ($6) { + for (std::vector<Value*>::iterator I = $6->begin(), E = $6->end(); + I != E; ++I) + ParamTypes.push_back((*I)->getType()); + } + + bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy; + if (isVarArg) ParamTypes.pop_back(); + + if (!(*$3)->isFirstClassType() && *$3 != Type::VoidTy) + GEN_ERROR("LLVM functions cannot return aggregate types!"); + + Ty = FunctionType::get($3->get(), ParamTypes, isVarArg); + PFTy = PointerType::get(Ty); } - delete $2; - Value *V = getVal(Ty, $3); // Get the method we're calling... + Value *V = getVal(PFTy, $4); // Get the function we're calling... + CHECK_FOR_ERROR // Create the call node... - if (!$5) { // Has no arguments? - $$ = new CallInst(V->castMethodAsserting(), vector<Value*>()); + if (!$6) { // Has no arguments? + // Make sure no arguments is a good thing! + if (Ty->getNumParams() != 0) + GEN_ERROR("No arguments passed to a function that " + "expects arguments!"); + + $$ = new CallInst(V, std::vector<Value*>()); } else { // Has arguments? - // Loop through MethodType's arguments and ensure they are specified + // Loop through FunctionType's arguments and ensure they are specified // correctly! // - MethodType::ParamTypes::const_iterator I = Ty->getParamTypes().begin(); - MethodType::ParamTypes::const_iterator E = Ty->getParamTypes().end(); - list<Value*>::iterator ArgI = $5->begin(), ArgE = $5->end(); + FunctionType::param_iterator I = Ty->param_begin(); + FunctionType::param_iterator E = Ty->param_end(); + std::vector<Value*>::iterator ArgI = $6->begin(), ArgE = $6->end(); for (; ArgI != ArgE && I != E; ++ArgI, ++I) - if ((*ArgI)->getType() != *I) - ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" + - (*I)->getName() + "'!"); + if ((*ArgI)->getType() != *I) + GEN_ERROR("Parameter " +(*ArgI)->getName()+ " is not of type '" + + (*I)->getDescription() + "'!"); if (I != E || (ArgI != ArgE && !Ty->isVarArg())) - ThrowException("Invalid number of parameters detected!"); + GEN_ERROR("Invalid number of parameters detected!"); - $$ = new CallInst(V->castMethodAsserting(), - vector<Value*>($5->begin(), $5->end())); + $$ = new CallInst(V, *$6); } - delete $5; + cast<CallInst>($$)->setTailCall($1); + cast<CallInst>($$)->setCallingConv($2); + delete $3; + delete $6; + CHECK_FOR_ERROR } | MemoryInst { $$ = $1; + CHECK_FOR_ERROR + }; + + +// IndexList - List of indices for GEP based instructions... +IndexList : ',' ValueRefList { + $$ = $2; + CHECK_FOR_ERROR + } | /* empty */ { + $$ = new std::vector<Value*>(); + CHECK_FOR_ERROR + }; + +OptVolatile : VOLATILE { + $$ = true; + CHECK_FOR_ERROR } + | /* empty */ { + $$ = false; + CHECK_FOR_ERROR + }; + -// UByteList - List of ubyte values for load and store instructions -UByteList : ',' ConstVector { - $$ = $2; -} | /* empty */ { - $$ = new vector<ConstPoolVal*>(); -} -MemoryInst : MALLOC Types { - $$ = new MallocInst(PointerType::get(*$2)); +MemoryInst : MALLOC Types OptCAlign { + $$ = new MallocInst(*$2, 0, $3); delete $2; + CHECK_FOR_ERROR } - | MALLOC Types ',' UINT ValueRef { - if (!(*$2)->isArrayType() || ((const ArrayType*)$2->get())->isSized()) - ThrowException("Trying to allocate " + (*$2)->getName() + - " as unsized array!"); - const Type *Ty = PointerType::get(*$2); - $$ = new MallocInst(Ty, getVal($4, $5)); + | MALLOC Types ',' UINT ValueRef OptCAlign { + Value* tmpVal = getVal($4, $5); + CHECK_FOR_ERROR + $$ = new MallocInst(*$2, tmpVal, $6); delete $2; } - | ALLOCA Types { - $$ = new AllocaInst(PointerType::get(*$2)); + | ALLOCA Types OptCAlign { + $$ = new AllocaInst(*$2, 0, $3); delete $2; + CHECK_FOR_ERROR } - | ALLOCA Types ',' UINT ValueRef { - if (!(*$2)->isArrayType() || ((const ArrayType*)$2->get())->isSized()) - ThrowException("Trying to allocate " + (*$2)->getName() + - " as unsized array!"); - const Type *Ty = PointerType::get(*$2); - Value *ArrSize = getVal($4, $5); - $$ = new AllocaInst(Ty, ArrSize); + | ALLOCA Types ',' UINT ValueRef OptCAlign { + Value* tmpVal = getVal($4, $5); + CHECK_FOR_ERROR + $$ = new AllocaInst(*$2, tmpVal, $6); delete $2; } | FREE ResolvedVal { - if (!$2->getType()->isPointerType()) - ThrowException("Trying to free nonpointer type " + - $2->getType()->getName() + "!"); + if (!isa<PointerType>($2->getType())) + GEN_ERROR("Trying to free nonpointer type " + + $2->getType()->getDescription() + "!"); $$ = new FreeInst($2); + CHECK_FOR_ERROR + } + + | OptVolatile LOAD Types ValueRef { + if (!isa<PointerType>($3->get())) + GEN_ERROR("Can't load from nonpointer type: " + + (*$3)->getDescription()); + if (!cast<PointerType>($3->get())->getElementType()->isFirstClassType()) + GEN_ERROR("Can't load from pointer of non-first-class type: " + + (*$3)->getDescription()); + Value* tmpVal = getVal(*$3, $4); + CHECK_FOR_ERROR + $$ = new LoadInst(tmpVal, "", $1); + delete $3; + } + | OptVolatile STORE ResolvedVal ',' Types ValueRef { + const PointerType *PT = dyn_cast<PointerType>($5->get()); + if (!PT) + GEN_ERROR("Can't store to a nonpointer type: " + + (*$5)->getDescription()); + const Type *ElTy = PT->getElementType(); + if (ElTy != $3->getType()) + GEN_ERROR("Can't store '" + $3->getType()->getDescription() + + "' into space of type '" + ElTy->getDescription() + "'!"); + + Value* tmpVal = getVal(*$5, $6); + CHECK_FOR_ERROR + $$ = new StoreInst($3, tmpVal, $1); + delete $5; } + | GETELEMENTPTR Types ValueRef IndexList { + if (!isa<PointerType>($2->get())) + GEN_ERROR("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($2->get(), $4->begin(), $4->end()), + GTE = gep_type_end($2->get(), $4->begin(), $4->end()); + for (unsigned i = 0, e = $4->size(); i != e && GTI != GTE; ++i, ++GTI) + if (isa<StructType>(*GTI)) // Only change struct indices + if (ConstantInt *CUI = dyn_cast<ConstantInt>((*$4)[i])) + if (CUI->getType() == Type::UByteTy) + (*$4)[i] = ConstantExpr::getCast(CUI, Type::UIntTy); - | LOAD Types ValueRef UByteList { - if (!(*$2)->isPointerType()) - ThrowException("Can't load from nonpointer type: " + (*$2)->getName()); - if (LoadInst::getIndexedType(*$2, *$4) == 0) - ThrowException("Invalid indices for load instruction!"); - - $$ = new LoadInst(getVal(*$2, $3), *$4); - delete $4; // Free the vector... - delete $2; - } - | STORE ResolvedVal ',' Types ValueRef UByteList { - if (!(*$4)->isPointerType()) - ThrowException("Can't store to a nonpointer type: " + (*$4)->getName()); - const Type *ElTy = StoreInst::getIndexedType(*$4, *$6); - if (ElTy == 0) - ThrowException("Can't store into that field list!"); - if (ElTy != $2->getType()) - ThrowException("Can't store '" + $2->getType()->getName() + - "' into space of type '" + ElTy->getName() + "'!"); - $$ = new StoreInst($2, getVal(*$4, $5), *$6); - delete $4; delete $6; - } - | GETELEMENTPTR Types ValueRef UByteList { - if (!(*$2)->isPointerType()) - ThrowException("getelementptr insn requires pointer operand!"); if (!GetElementPtrInst::getIndexedType(*$2, *$4, true)) - ThrowException("Can't get element ptr '" + (*$2)->getName() + "'!"); - $$ = new GetElementPtrInst(getVal(*$2, $3), *$4); - delete $2; delete $4; - } + GEN_ERROR("Invalid getelementptr indices for type '" + + (*$2)->getDescription()+ "'!"); + Value* tmpVal = getVal(*$2, $3); + CHECK_FOR_ERROR + $$ = new GetElementPtrInst(tmpVal, *$4); + delete $2; + delete $4; + }; + %% + +void llvm::GenerateError(const std::string &message, int LineNo) { + if (LineNo == -1) LineNo = llvmAsmlineno; + // TODO: column number in exception + if (TheParseError) + TheParseError->setError(CurFilename, message, LineNo); + TriggerError = 1; +} + int yyerror(const char *ErrorMsg) { - ThrowException(string("Parse error: ") + 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) + "'"; + GenerateError(errMsg); return 0; } diff --git a/llvm/lib/AsmParser/llvmAsmParser.y.cvs b/llvm/lib/AsmParser/llvmAsmParser.y.cvs index d40b653..8eea9ab 100644 --- a/llvm/lib/AsmParser/llvmAsmParser.y.cvs +++ b/llvm/lib/AsmParser/llvmAsmParser.y.cvs @@ -2102,8 +2102,8 @@ Function : BasicBlockList END { }; FnDeclareLinkage: /*default*/ | - DLLIMPORT { CurFun.Linkage = GlobalValue::DLLImportLinkage } | - EXTERN_WEAK { CurFun.Linkage = GlobalValue::DLLImportLinkage }; + DLLIMPORT { CurFun.Linkage = GlobalValue::DLLImportLinkage; } | + EXTERN_WEAK { CurFun.Linkage = GlobalValue::DLLImportLinkage; }; FunctionProto : DECLARE { CurFun.isDeclare = true; } FnDeclareLinkage FunctionHeaderH { $$ = CurFun.CurrentFunction; |